./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/forester-heap/dll-token-1.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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:48:57,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:48:57,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:48:57,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:48:57,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:48:57,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:48:57,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:48:57,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:48:57,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:48:57,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:48:57,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:48:57,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:48:57,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:48:57,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:48:57,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:48:57,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:48:57,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:48:57,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:48:57,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:48:57,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:48:57,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:48:57,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:48:57,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:48:57,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:48:57,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:48:57,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:48:57,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:48:57,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:48:57,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:48:57,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:48:57,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:48:57,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:48:57,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:48:57,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:48:57,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:48:57,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:48:57,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:48:57,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:48:57,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:48:57,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:48:57,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:48:57,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 23:48:57,698 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:48:57,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:48:57,699 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:48:57,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:48:57,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:48:57,700 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:48:57,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:48:57,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:48:57,702 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:48:57,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:48:57,703 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:48:57,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 23:48:57,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:48:57,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:48:57,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:48:57,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:48:57,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:48:57,704 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:48:57,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:48:57,704 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:48:57,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:48:57,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:48:57,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:48:57,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:48:57,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:48:57,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:48:57,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:48:57,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:48:57,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 23:48:57,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 23:48:57,707 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:48:57,707 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:48:57,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:48:57,707 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2021-12-27 23:48:58,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:48:58,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:48:58,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:48:58,057 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:48:58,058 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:48:58,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2021-12-27 23:48:58,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e587109/6ece5389cf0e4dcea86078d562adc14b/FLAG53223f0a3 [2021-12-27 23:48:58,667 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:48:58,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2021-12-27 23:48:58,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e587109/6ece5389cf0e4dcea86078d562adc14b/FLAG53223f0a3 [2021-12-27 23:48:59,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e587109/6ece5389cf0e4dcea86078d562adc14b [2021-12-27 23:48:59,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:48:59,099 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:48:59,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:48:59,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:48:59,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:48:59,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4c3272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59, skipping insertion in model container [2021-12-27 23:48:59,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:48:59,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:48:59,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2021-12-27 23:48:59,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2021-12-27 23:48:59,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2021-12-27 23:48:59,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2021-12-27 23:48:59,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2021-12-27 23:48:59,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2021-12-27 23:48:59,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:48:59,399 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:48:59,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2021-12-27 23:48:59,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2021-12-27 23:48:59,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2021-12-27 23:48:59,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2021-12-27 23:48:59,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2021-12-27 23:48:59,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2021-12-27 23:48:59,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:48:59,460 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:48:59,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59 WrapperNode [2021-12-27 23:48:59,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:48:59,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:48:59,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:48:59,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:48:59,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,499 INFO L137 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2021-12-27 23:48:59,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:48:59,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:48:59,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:48:59,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:48:59,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:48:59,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:48:59,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:48:59,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:48:59,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (1/1) ... [2021-12-27 23:48:59,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:48:59,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:48:59,571 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-27 23:48:59,587 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-27 23:48:59,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 23:48:59,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-27 23:48:59,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 23:48:59,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:48:59,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-27 23:48:59,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-27 23:48:59,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:48:59,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 23:48:59,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:48:59,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:48:59,731 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:48:59,733 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:49:00,007 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:49:00,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:49:00,013 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-27 23:49:00,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:49:00 BoogieIcfgContainer [2021-12-27 23:49:00,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:49:00,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:49:00,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:49:00,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:49:00,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:48:59" (1/3) ... [2021-12-27 23:49:00,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f99527a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:49:00, skipping insertion in model container [2021-12-27 23:49:00,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:48:59" (2/3) ... [2021-12-27 23:49:00,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f99527a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:49:00, skipping insertion in model container [2021-12-27 23:49:00,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:49:00" (3/3) ... [2021-12-27 23:49:00,025 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2021-12-27 23:49:00,030 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:49:00,031 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-12-27 23:49:00,084 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:49:00,089 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-27 23:49:00,090 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-27 23:49:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-27 23:49:00,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:00,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-27 23:49:00,106 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:00,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:00,111 INFO L85 PathProgramCache]: Analyzing trace with hash 890337990, now seen corresponding path program 1 times [2021-12-27 23:49:00,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:00,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101569149] [2021-12-27 23:49:00,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:00,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:00,325 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-27 23:49:00,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:00,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101569149] [2021-12-27 23:49:00,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101569149] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:00,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:00,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 23:49:00,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891978383] [2021-12-27 23:49:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:00,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 23:49:00,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:00,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 23:49:00,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:49:00,368 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:00,392 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2021-12-27 23:49:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 23:49:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-27 23:49:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:00,401 INFO L225 Difference]: With dead ends: 86 [2021-12-27 23:49:00,402 INFO L226 Difference]: Without dead ends: 39 [2021-12-27 23:49:00,404 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-27 23:49:00,410 INFO L933 BasicCegarLoop]: 46 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, 46 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-27 23:49:00,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:49:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-27 23:49:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-27 23:49:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 38 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-27 23:49:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-12-27 23:49:00,451 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2021-12-27 23:49:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:00,451 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-12-27 23:49:00,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2021-12-27 23:49:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-27 23:49:00,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:00,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-27 23:49:00,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 23:49:00,453 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash 889571369, now seen corresponding path program 1 times [2021-12-27 23:49:00,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:00,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227328691] [2021-12-27 23:49:00,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:00,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:00,641 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-27 23:49:00,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:00,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227328691] [2021-12-27 23:49:00,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227328691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:00,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:00,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:49:00,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202068686] [2021-12-27 23:49:00,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:00,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:49:00,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:00,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:49:00,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:49:00,654 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:00,758 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-12-27 23:49:00,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 23:49:00,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-27 23:49:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:00,762 INFO L225 Difference]: With dead ends: 39 [2021-12-27 23:49:00,762 INFO L226 Difference]: Without dead ends: 37 [2021-12-27 23:49:00,764 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-27 23:49:00,766 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:00,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:49:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-27 23:49:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-27 23:49:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 36 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-27 23:49:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2021-12-27 23:49:00,776 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2021-12-27 23:49:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:00,780 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-12-27 23:49:00,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-12-27 23:49:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-27 23:49:00,781 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:00,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:00,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 23:49:00,782 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1806865149, now seen corresponding path program 1 times [2021-12-27 23:49:00,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:00,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312133678] [2021-12-27 23:49:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:00,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:00,916 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-27 23:49:00,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312133678] [2021-12-27 23:49:00,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312133678] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:00,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:00,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:49:00,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210682802] [2021-12-27 23:49:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:00,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:49:00,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:49:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:49:00,924 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:00,994 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-12-27 23:49:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:49:00,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-27 23:49:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:00,997 INFO L225 Difference]: With dead ends: 63 [2021-12-27 23:49:00,997 INFO L226 Difference]: Without dead ends: 61 [2021-12-27 23:49:00,998 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-27 23:49:01,000 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 72 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:01,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 48 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:49:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-27 23:49:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2021-12-27 23:49:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 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-27 23:49:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2021-12-27 23:49:01,012 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2021-12-27 23:49:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:01,012 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2021-12-27 23:49:01,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2021-12-27 23:49:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 23:49:01,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:01,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:01,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 23:49:01,015 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash -913382283, now seen corresponding path program 1 times [2021-12-27 23:49:01,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:01,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100381906] [2021-12-27 23:49:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:01,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:01,100 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-27 23:49:01,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:01,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100381906] [2021-12-27 23:49:01,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100381906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:01,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:01,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:49:01,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132148169] [2021-12-27 23:49:01,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:01,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:49:01,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:01,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:49:01,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:49:01,117 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:01,189 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2021-12-27 23:49:01,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:49:01,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-27 23:49:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:01,190 INFO L225 Difference]: With dead ends: 35 [2021-12-27 23:49:01,191 INFO L226 Difference]: Without dead ends: 33 [2021-12-27 23:49:01,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:49:01,192 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:01,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:49:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-27 23:49:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-27 23:49:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 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-27 23:49:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2021-12-27 23:49:01,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2021-12-27 23:49:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:01,196 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-12-27 23:49:01,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2021-12-27 23:49:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 23:49:01,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:01,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:01,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 23:49:01,197 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash -913344547, now seen corresponding path program 1 times [2021-12-27 23:49:01,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:01,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604764799] [2021-12-27 23:49:01,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:01,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:01,317 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-27 23:49:01,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:01,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604764799] [2021-12-27 23:49:01,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604764799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:01,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:01,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:49:01,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754806561] [2021-12-27 23:49:01,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:01,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:49:01,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:49:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:49:01,320 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:01,412 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-27 23:49:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:49:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-27 23:49:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:01,413 INFO L225 Difference]: With dead ends: 68 [2021-12-27 23:49:01,413 INFO L226 Difference]: Without dead ends: 44 [2021-12-27 23:49:01,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:49:01,415 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:01,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:49:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-27 23:49:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2021-12-27 23:49:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 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-27 23:49:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2021-12-27 23:49:01,420 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2021-12-27 23:49:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:01,420 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2021-12-27 23:49:01,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2021-12-27 23:49:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 23:49:01,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:01,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:01,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 23:49:01,422 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash -313255267, now seen corresponding path program 1 times [2021-12-27 23:49:01,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:01,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005895931] [2021-12-27 23:49:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:01,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:01,577 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-27 23:49:01,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:01,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005895931] [2021-12-27 23:49:01,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005895931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:01,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:01,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 23:49:01,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481578680] [2021-12-27 23:49:01,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:01,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:49:01,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:01,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:49:01,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:49:01,586 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-27 23:49:01,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:01,725 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-12-27 23:49:01,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 23:49:01,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-27 23:49:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:01,727 INFO L225 Difference]: With dead ends: 50 [2021-12-27 23:49:01,727 INFO L226 Difference]: Without dead ends: 48 [2021-12-27 23:49:01,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-27 23:49:01,728 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:01,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 107 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 23:49:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-27 23:49:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-12-27 23:49:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 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-27 23:49:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2021-12-27 23:49:01,738 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2021-12-27 23:49:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:01,738 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2021-12-27 23:49:01,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-27 23:49:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2021-12-27 23:49:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 23:49:01,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:01,739 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:01,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-27 23:49:01,740 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash -648614522, now seen corresponding path program 1 times [2021-12-27 23:49:01,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:01,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39323908] [2021-12-27 23:49:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:01,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:01,943 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-27 23:49:01,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:01,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39323908] [2021-12-27 23:49:01,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39323908] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:49:01,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318285072] [2021-12-27 23:49:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:01,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:01,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:01,946 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-27 23:49:01,947 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-27 23:49:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:02,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-27 23:49:02,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:02,216 INFO L387 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-27 23:49:02,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-27 23:49:02,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:02,302 INFO L387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-12-27 23:49:02,311 INFO L387 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 18 treesize of output 18 [2021-12-27 23:49:02,319 INFO L387 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 63 treesize of output 39 [2021-12-27 23:49:02,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:02,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:02,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:02,329 INFO L387 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 19 treesize of output 18 [2021-12-27 23:49:02,335 INFO L387 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 18 treesize of output 16 [2021-12-27 23:49:02,353 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-27 23:49:02,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-27 23:49:02,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:02,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:02,488 INFO L353 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2021-12-27 23:49:02,489 INFO L387 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 3 case distinctions, treesize of input 37 treesize of output 38 [2021-12-27 23:49:02,502 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-27 23:49:02,503 INFO L387 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 16 treesize of output 18 [2021-12-27 23:49:02,544 INFO L387 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-27 23:49:02,548 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-27 23:49:02,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:49:02,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:02,581 INFO L387 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 33 treesize of output 34 [2021-12-27 23:49:02,585 INFO L387 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 71 treesize of output 51 [2021-12-27 23:49:02,589 INFO L387 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 24 treesize of output 22 [2021-12-27 23:49:03,272 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:03,272 INFO L387 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 125 treesize of output 101 [2021-12-27 23:49:03,278 INFO L387 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 198 treesize of output 178 [2021-12-27 23:49:03,286 INFO L387 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 178 treesize of output 170 [2021-12-27 23:49:08,886 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1068 Int) (v_arrayElimCell_14 Int) (v_ArrVal_1077 (Array Int Int)) (v_arrayElimCell_15 Int) (v_ArrVal_1075 (Array Int Int)) (v_arrayElimCell_12 Int)) (let ((.cse1 (= v_arrayElimCell_15 v_arrayElimCell_12)) (.cse0 (= v_arrayElimCell_14 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse0 .cse1 (forall ((v_ArrVal_1081 (Array Int Int)) (v_arrayElimCell_13 Int)) (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1068)) v_arrayElimCell_14 v_ArrVal_1075) v_arrayElimCell_15 v_ArrVal_1077) v_arrayElimCell_12 v_ArrVal_1081) v_arrayElimCell_13 v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0))) (let ((.cse2 (not .cse0))) (and (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1068))) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (or (and .cse2 (= (select (select (store (store .cse3 v_arrayElimCell_14 v_ArrVal_1077) v_arrayElimCell_12 v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) 0)) (and (= (select (select (store (store (store .cse3 v_arrayElimCell_14 v_ArrVal_1075) v_arrayElimCell_15 v_ArrVal_1077) v_arrayElimCell_12 v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4) 0) .cse0))) (or .cse2 (not .cse1)))) (not (= (select (store |c_#valid| v_arrayElimCell_14 1) v_arrayElimCell_12) 0)) (not (= (select |c_#valid| v_arrayElimCell_14) 0))))) is different from false [2021-12-27 23:49:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-27 23:49:13,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318285072] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:49:13,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:49:13,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-27 23:49:13,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11319312] [2021-12-27 23:49:13,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:49:13,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 23:49:13,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:13,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 23:49:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2021-12-27 23:49:13,026 INFO L87 Difference]: Start difference. First operand 46 states and 49 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-27 23:49:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:13,220 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-12-27 23:49:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:49:13,220 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 16 [2021-12-27 23:49:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:13,221 INFO L225 Difference]: With dead ends: 58 [2021-12-27 23:49:13,221 INFO L226 Difference]: Without dead ends: 56 [2021-12-27 23:49:13,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=113, Unknown=2, NotChecked=22, Total=182 [2021-12-27 23:49:13,226 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 46 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:13,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 152 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2021-12-27 23:49:13,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-27 23:49:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2021-12-27 23:49:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-27 23:49:13,238 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2021-12-27 23:49:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:13,239 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-27 23:49:13,239 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-27 23:49:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-27 23:49:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-27 23:49:13,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:13,240 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:13,270 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-27 23:49:13,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:13,456 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1000772550, now seen corresponding path program 1 times [2021-12-27 23:49:13,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:13,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411944745] [2021-12-27 23:49:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:13,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:13,608 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-27 23:49:13,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:13,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411944745] [2021-12-27 23:49:13,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411944745] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:49:13,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392623577] [2021-12-27 23:49:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:13,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:13,610 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-27 23:49:13,619 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-27 23:49:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:13,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-27 23:49:13,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:13,793 INFO L387 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-27 23:49:13,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-27 23:49:13,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:13,845 INFO L387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-12-27 23:49:13,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:13,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:13,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:13,852 INFO L387 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 19 treesize of output 18 [2021-12-27 23:49:13,856 INFO L387 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 18 treesize of output 18 [2021-12-27 23:49:13,860 INFO L387 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 50 treesize of output 30 [2021-12-27 23:49:13,863 INFO L387 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 18 treesize of output 16 [2021-12-27 23:49:13,877 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-27 23:49:13,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-27 23:49:13,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:13,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:13,974 INFO L353 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2021-12-27 23:49:13,974 INFO L387 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 3 case distinctions, treesize of input 37 treesize of output 38 [2021-12-27 23:49:13,985 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-27 23:49:13,986 INFO L387 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 16 treesize of output 18 [2021-12-27 23:49:14,011 INFO L387 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-27 23:49:14,029 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-27 23:49:14,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:49:14,057 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:14,058 INFO L387 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 34 treesize of output 35 [2021-12-27 23:49:14,061 INFO L387 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 74 treesize of output 54 [2021-12-27 23:49:14,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-12-27 23:49:14,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_27 Int)) (or (let ((.cse0 (= v_arrayElimCell_27 |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1449) v_arrayElimCell_27 v_ArrVal_1455) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 1)))) (or (forall ((v_ArrVal_1449 (Array Int Int)) (v_arrayElimCell_28 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1449) v_arrayElimCell_27 v_ArrVal_1454) v_arrayElimCell_28 v_ArrVal_1455) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 1))) (not .cse0)))) (not (= (select |c_#valid| v_arrayElimCell_27) 0)))) is different from false [2021-12-27 23:49:14,206 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:14,207 INFO L387 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 127 treesize of output 104 [2021-12-27 23:49:14,211 INFO L387 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 203 treesize of output 183 [2021-12-27 23:49:14,215 INFO L387 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 183 treesize of output 175 [2021-12-27 23:49:14,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_27 Int)) (or (not (= 0 (select (store |c_#valid| v_arrayElimCell_29 1) v_arrayElimCell_27))) (not (= (select |c_#valid| v_arrayElimCell_29) 0)) (and (forall ((v_arrayElimCell_30 Int)) (let ((.cse0 (= v_arrayElimCell_29 |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and .cse0 (= v_arrayElimCell_27 v_arrayElimCell_30)) (and (or (forall ((v_ArrVal_1441 Int) (v_ArrVal_1443 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1441)) v_arrayElimCell_29 v_ArrVal_1443) v_arrayElimCell_30 v_prenex_3) v_arrayElimCell_27 v_prenex_4) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 1))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_1441 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1441)) v_arrayElimCell_29 v_prenex_3) v_arrayElimCell_27 v_prenex_4) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 1)))))))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1441 Int) (v_ArrVal_1443 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1441)) v_arrayElimCell_29 v_ArrVal_1443) v_arrayElimCell_27 v_ArrVal_1454) v_arrayElimCell_28 v_ArrVal_1455) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 1))) (not (= v_arrayElimCell_29 |c_ULTIMATE.start_main_~x~0#1.base|)))))) is different from false [2021-12-27 23:49:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-27 23:49:15,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392623577] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:49:15,063 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 23:49:15,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-27 23:49:15,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271931746] [2021-12-27 23:49:15,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 23:49:15,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 23:49:15,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 23:49:15,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2021-12-27 23:49:15,066 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:15,289 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-12-27 23:49:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:49:15,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-27 23:49:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:15,292 INFO L225 Difference]: With dead ends: 68 [2021-12-27 23:49:15,292 INFO L226 Difference]: Without dead ends: 52 [2021-12-27 23:49:15,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=96, Unknown=2, NotChecked=42, Total=182 [2021-12-27 23:49:15,293 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:15,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 210 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2021-12-27 23:49:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-27 23:49:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2021-12-27 23:49:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-12-27 23:49:15,296 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2021-12-27 23:49:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:15,297 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-12-27 23:49:15,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-12-27 23:49:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-27 23:49:15,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:15,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:15,329 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-27 23:49:15,498 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,SelfDestructingSolverStorable7 [2021-12-27 23:49:15,498 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1552465966, now seen corresponding path program 1 times [2021-12-27 23:49:15,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:15,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713394412] [2021-12-27 23:49:15,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:15,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:15,554 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-27 23:49:15,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:15,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713394412] [2021-12-27 23:49:15,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713394412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:15,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:15,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:49:15,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786249920] [2021-12-27 23:49:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:15,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:49:15,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:49:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:49:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:49:15,557 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:15,604 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-12-27 23:49:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:49:15,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-27 23:49:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:15,605 INFO L225 Difference]: With dead ends: 50 [2021-12-27 23:49:15,605 INFO L226 Difference]: Without dead ends: 31 [2021-12-27 23:49:15,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:49:15,606 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:15,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:49:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-27 23:49:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-27 23:49:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 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-27 23:49:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-12-27 23:49:15,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2021-12-27 23:49:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:15,610 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-12-27 23:49:15,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-12-27 23:49:15,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-27 23:49:15,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:15,611 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:15,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-27 23:49:15,611 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1970202869, now seen corresponding path program 1 times [2021-12-27 23:49:15,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:49:15,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303786092] [2021-12-27 23:49:15,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:15,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:49:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:15,860 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-27 23:49:15,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:49:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303786092] [2021-12-27 23:49:15,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303786092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 23:49:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685421814] [2021-12-27 23:49:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:15,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:15,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:15,863 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-27 23:49:15,863 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-27 23:49:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:16,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-27 23:49:16,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:16,061 INFO L387 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-27 23:49:16,099 INFO L387 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 36 treesize of output 27 [2021-12-27 23:49:16,104 INFO L387 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 36 treesize of output 27 [2021-12-27 23:49:16,121 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2021-12-27 23:49:16,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2021-12-27 23:49:16,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:16,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:16,131 INFO L387 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 28 treesize of output 25 [2021-12-27 23:49:16,146 INFO L353 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-27 23:49:16,146 INFO L387 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-27 23:49:16,152 INFO L387 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 30 treesize of output 28 [2021-12-27 23:49:16,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:16,349 INFO L353 Elim1Store]: treesize reduction 100, result has 30.6 percent of original size [2021-12-27 23:49:16,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 206 [2021-12-27 23:49:16,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:16,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 60 [2021-12-27 23:49:16,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:16,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:16,406 INFO L353 Elim1Store]: treesize reduction 44, result has 50.6 percent of original size [2021-12-27 23:49:16,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 103 [2021-12-27 23:49:16,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:16,457 INFO L353 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-12-27 23:49:16,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 83 [2021-12-27 23:49:16,468 INFO L387 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 56 treesize of output 48 [2021-12-27 23:49:16,488 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-12-27 23:49:16,488 INFO L387 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 20 treesize of output 22 [2021-12-27 23:49:16,499 INFO L387 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 59 treesize of output 51 [2021-12-27 23:49:16,509 INFO L387 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 33 treesize of output 35 [2021-12-27 23:49:16,518 INFO L387 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 46 treesize of output 40 [2021-12-27 23:49:16,681 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:16,682 INFO L387 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2021-12-27 23:49:16,792 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:16,793 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2021-12-27 23:49:16,859 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:16,859 INFO L387 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 52 [2021-12-27 23:49:17,007 INFO L387 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 24 [2021-12-27 23:49:17,010 INFO L387 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 22 treesize of output 10 [2021-12-27 23:49:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:17,037 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,037 INFO L387 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 17 treesize of output 10 [2021-12-27 23:49:17,043 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-27 23:49:17,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:49:17,094 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,094 INFO L387 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 96 treesize of output 94 [2021-12-27 23:49:17,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:17,104 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2021-12-27 23:49:17,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,118 INFO L387 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 431 treesize of output 434 [2021-12-27 23:49:17,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,126 INFO L387 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 430 treesize of output 424 [2021-12-27 23:49:17,147 INFO L387 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 349 treesize of output 287 [2021-12-27 23:49:17,155 INFO L387 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 158 treesize of output 127 [2021-12-27 23:49:17,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_18 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (or (not (= (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= (select |c_#valid| (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|)) 0)) (and (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1961) .cse0 v_ArrVal_1976) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) .cse0 v_ArrVal_1974) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1959) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)))) (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (let ((.cse1 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20) .cse1 v_ArrVal_1962) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) .cse1 v_ArrVal_1985) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1969)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (= (select (select (let ((.cse2 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1961) .cse2 v_ArrVal_1976) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) .cse2 v_ArrVal_1974) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1959)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2021-12-27 23:49:17,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-27 23:49:17,857 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,858 INFO L387 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 523 treesize of output 419 [2021-12-27 23:49:17,863 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,864 INFO L387 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 419 treesize of output 307 [2021-12-27 23:49:17,902 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,903 INFO L387 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 15890 treesize of output 14281 [2021-12-27 23:49:17,992 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:17,994 INFO L387 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 31458 treesize of output 27405 [2021-12-27 23:49:18,180 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:18,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27405 treesize of output 27375 [2021-12-27 23:49:18,356 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:18,357 INFO L387 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 27375 treesize of output 22515 [2021-12-27 23:49:18,519 INFO L387 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 22515 treesize of output 22463 [2021-12-27 23:49:18,674 INFO L387 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 22463 treesize of output 21817 [2021-12-27 23:49:18,839 INFO L387 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 21817 treesize of output 21081 [2021-12-27 23:49:19,004 INFO L387 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 21081 treesize of output 21055 [2021-12-27 23:49:19,319 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:19,320 INFO L387 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 20946 treesize of output 20651 [2021-12-27 23:49:19,478 INFO L387 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 20642 treesize of output 20474 [2021-12-27 23:49:19,647 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:19,648 INFO L387 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 20474 treesize of output 20243 [2021-12-27 23:49:19,808 INFO L387 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 20234 treesize of output 20170 [2021-12-27 23:49:19,954 INFO L387 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 20170 treesize of output 20010 [2021-12-27 23:49:20,093 INFO L387 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 20010 treesize of output 19690 [2021-12-27 23:49:20,204 INFO L387 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 19690 treesize of output 19610 [2021-12-27 23:49:20,301 INFO L387 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 19610 treesize of output 19562 [2021-12-27 23:49:20,422 INFO L387 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 19562 treesize of output 19466 [2021-12-27 23:49:20,529 INFO L387 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 19466 treesize of output 19442 [2021-12-27 23:49:20,655 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:49:20,656 INFO L387 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 19442 treesize of output 19259 [2021-12-27 23:49:20,747 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2021-12-27 23:49:20,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-27 23:49:20,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 23:49:20,964 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-27 23:49:20,969 INFO L158 Benchmark]: Toolchain (without parser) took 21869.84ms. Allocated memory was 58.7MB in the beginning and 394.3MB in the end (delta: 335.5MB). Free memory was 36.3MB in the beginning and 306.1MB in the end (delta: -269.8MB). Peak memory consumption was 242.9MB. Max. memory is 16.1GB. [2021-12-27 23:49:20,969 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:49:20,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.92ms. Allocated memory is still 58.7MB. Free memory was 36.2MB in the beginning and 35.4MB in the end (delta: 812.2kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-27 23:49:20,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.58ms. Allocated memory is still 58.7MB. Free memory was 35.2MB in the beginning and 33.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:49:20,970 INFO L158 Benchmark]: Boogie Preprocessor took 38.18ms. Allocated memory is still 58.7MB. Free memory was 33.2MB in the beginning and 31.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:49:20,971 INFO L158 Benchmark]: RCFGBuilder took 473.73ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 31.5MB in the beginning and 44.0MB in the end (delta: -12.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2021-12-27 23:49:20,971 INFO L158 Benchmark]: TraceAbstraction took 20952.58ms. Allocated memory was 71.3MB in the beginning and 394.3MB in the end (delta: 323.0MB). Free memory was 43.7MB in the beginning and 306.1MB in the end (delta: -262.4MB). Peak memory consumption was 237.4MB. Max. memory is 16.1GB. [2021-12-27 23:49:20,978 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.20ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.92ms. Allocated memory is still 58.7MB. Free memory was 36.2MB in the beginning and 35.4MB in the end (delta: 812.2kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.58ms. Allocated memory is still 58.7MB. Free memory was 35.2MB in the beginning and 33.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.18ms. Allocated memory is still 58.7MB. Free memory was 33.2MB in the beginning and 31.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.73ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 31.5MB in the beginning and 44.0MB in the end (delta: -12.6MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20952.58ms. Allocated memory was 71.3MB in the beginning and 394.3MB in the end (delta: 323.0MB). Free memory was 43.7MB in the beginning and 306.1MB in the end (delta: -262.4MB). Peak memory consumption was 237.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-27 23:49:21,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 23:49:22,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:49:22,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:49:22,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:49:22,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:49:22,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:49:22,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:49:22,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:49:22,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:49:22,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:49:22,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:49:22,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:49:22,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:49:22,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:49:22,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:49:22,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:49:22,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:49:22,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:49:22,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:49:22,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:49:22,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:49:22,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:49:22,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:49:22,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:49:22,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:49:22,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:49:22,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:49:22,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:49:22,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:49:22,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:49:22,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:49:22,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:49:22,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:49:22,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:49:22,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:49:22,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:49:22,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:49:22,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:49:22,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:49:22,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:49:22,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:49:22,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-27 23:49:23,008 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:49:23,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:49:23,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:49:23,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:49:23,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:49:23,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:49:23,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:49:23,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:49:23,014 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:49:23,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:49:23,015 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:49:23,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:49:23,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:49:23,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:49:23,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:49:23,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:49:23,016 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-27 23:49:23,016 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-27 23:49:23,016 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-27 23:49:23,016 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:49:23,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:49:23,016 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:49:23,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:49:23,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:49:23,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:49:23,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:49:23,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:49:23,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:49:23,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:49:23,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:49:23,018 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-27 23:49:23,018 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-27 23:49:23,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:49:23,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:49:23,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:49:23,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-27 23:49:23,019 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2021-12-27 23:49:23,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:49:23,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:49:23,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:49:23,352 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:49:23,352 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:49:23,354 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2021-12-27 23:49:23,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2f79810/b33ad34d43d742ecbac2878e6be76415/FLAG3087db571 [2021-12-27 23:49:23,867 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:49:23,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2021-12-27 23:49:23,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2f79810/b33ad34d43d742ecbac2878e6be76415/FLAG3087db571 [2021-12-27 23:49:23,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2f79810/b33ad34d43d742ecbac2878e6be76415 [2021-12-27 23:49:23,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:49:23,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:49:23,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:49:23,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:49:23,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:49:23,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:49:23" (1/1) ... [2021-12-27 23:49:23,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8f639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:23, skipping insertion in model container [2021-12-27 23:49:23,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:49:23" (1/1) ... [2021-12-27 23:49:23,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:49:23,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:49:24,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2021-12-27 23:49:24,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2021-12-27 23:49:24,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2021-12-27 23:49:24,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2021-12-27 23:49:24,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2021-12-27 23:49:24,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2021-12-27 23:49:24,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:49:24,286 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:49:24,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2021-12-27 23:49:24,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2021-12-27 23:49:24,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2021-12-27 23:49:24,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2021-12-27 23:49:24,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2021-12-27 23:49:24,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2021-12-27 23:49:24,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:49:24,395 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:49:24,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24 WrapperNode [2021-12-27 23:49:24,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:49:24,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:49:24,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:49:24,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:49:24,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,470 INFO L137 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2021-12-27 23:49:24,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:49:24,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:49:24,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:49:24,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:49:24,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:49:24,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:49:24,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:49:24,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:49:24,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (1/1) ... [2021-12-27 23:49:24,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:49:24,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:49:24,564 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-27 23:49:24,577 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-27 23:49:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-27 23:49:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-27 23:49:24,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:49:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-27 23:49:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-27 23:49:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:49:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-27 23:49:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-27 23:49:24,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:49:24,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:49:24,687 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:49:24,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:49:25,142 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:49:25,148 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:49:25,148 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-12-27 23:49:25,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:49:25 BoogieIcfgContainer [2021-12-27 23:49:25,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:49:25,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:49:25,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:49:25,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:49:25,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:49:23" (1/3) ... [2021-12-27 23:49:25,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b42b013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:49:25, skipping insertion in model container [2021-12-27 23:49:25,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:49:24" (2/3) ... [2021-12-27 23:49:25,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b42b013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:49:25, skipping insertion in model container [2021-12-27 23:49:25,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:49:25" (3/3) ... [2021-12-27 23:49:25,156 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2021-12-27 23:49:25,163 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:49:25,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-12-27 23:49:25,210 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:49:25,216 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-27 23:49:25,216 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-27 23:49:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:25,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-27 23:49:25,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:25,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-27 23:49:25,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash 28699849, now seen corresponding path program 1 times [2021-12-27 23:49:25,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:49:25,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49072430] [2021-12-27 23:49:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:25,259 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:49:25,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:49:25,262 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-27 23:49:25,264 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-27 23:49:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:25,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-27 23:49:25,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:25,527 INFO L387 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-27 23:49:25,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:25,637 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:49:25,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-27 23:49:25,653 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-27 23:49:25,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:49:25,654 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:49:25,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49072430] [2021-12-27 23:49:25,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49072430] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:25,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:25,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:49:25,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039305470] [2021-12-27 23:49:25,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:25,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:49:25,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:49:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:49:25,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:49:25,689 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:26,090 INFO L93 Difference]: Finished difference Result 82 states and 128 transitions. [2021-12-27 23:49:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 23:49:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-27 23:49:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:26,099 INFO L225 Difference]: With dead ends: 82 [2021-12-27 23:49:26,099 INFO L226 Difference]: Without dead ends: 36 [2021-12-27 23:49:26,101 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-27 23:49:26,104 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:26,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-27 23:49:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-27 23:49:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-27 23:49:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 35 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-27 23:49:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2021-12-27 23:49:26,130 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2021-12-27 23:49:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:26,130 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-12-27 23:49:26,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2021-12-27 23:49:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-27 23:49:26,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:26,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-27 23:49:26,149 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-27 23:49:26,347 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-27 23:49:26,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash 889651804, now seen corresponding path program 1 times [2021-12-27 23:49:26,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:49:26,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551553569] [2021-12-27 23:49:26,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:26,349 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:49:26,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:49:26,351 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-27 23:49:26,353 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-27 23:49:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:26,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 23:49:26,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:26,518 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-27 23:49:26,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:49:26,519 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:49:26,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551553569] [2021-12-27 23:49:26,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551553569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:26,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:26,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:49:26,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294135060] [2021-12-27 23:49:26,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:26,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:49:26,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:49:26,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:49:26,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:49:26,521 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:26,691 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2021-12-27 23:49:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:49:26,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-27 23:49:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:26,692 INFO L225 Difference]: With dead ends: 62 [2021-12-27 23:49:26,692 INFO L226 Difference]: Without dead ends: 60 [2021-12-27 23:49:26,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:49:26,694 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 71 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:26,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 23:49:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-27 23:49:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2021-12-27 23:49:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2021-12-27 23:49:26,700 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 6 [2021-12-27 23:49:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:26,700 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2021-12-27 23:49:26,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2021-12-27 23:49:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-27 23:49:26,701 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:26,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:26,720 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-27 23:49:26,920 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-27 23:49:26,921 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1061836619, now seen corresponding path program 1 times [2021-12-27 23:49:26,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:49:26,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515323859] [2021-12-27 23:49:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:26,922 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:49:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:49:26,924 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-27 23:49:26,925 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-27 23:49:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:27,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-27 23:49:27,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:27,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-27 23:49:27,135 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-27 23:49:27,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:49:27,136 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:49:27,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515323859] [2021-12-27 23:49:27,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515323859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:27,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:27,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:49:27,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658527195] [2021-12-27 23:49:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:27,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:49:27,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:49:27,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:49:27,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:49:27,139 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:27,467 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2021-12-27 23:49:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:49:27,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-27 23:49:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:27,470 INFO L225 Difference]: With dead ends: 34 [2021-12-27 23:49:27,470 INFO L226 Difference]: Without dead ends: 32 [2021-12-27 23:49:27,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:49:27,471 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:27,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 23:49:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-27 23:49:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-27 23:49:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-27 23:49:27,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2021-12-27 23:49:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:27,479 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-27 23:49:27,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-27 23:49:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-27 23:49:27,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:27,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:27,499 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-27 23:49:27,696 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-27 23:49:27,697 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1061798883, now seen corresponding path program 1 times [2021-12-27 23:49:27,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:49:27,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571032427] [2021-12-27 23:49:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:27,698 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:49:27,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:49:27,699 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-27 23:49:27,701 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-27 23:49:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:27,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-27 23:49:27,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:27,926 INFO L387 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-27 23:49:27,996 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-27 23:49:27,997 INFO L387 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 50 treesize of output 54 [2021-12-27 23:49:28,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:28,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:28,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-27 23:49:28,035 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:49:28,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-27 23:49:28,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-27 23:49:28,090 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-27 23:49:28,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:49:28,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:49:28,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571032427] [2021-12-27 23:49:28,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571032427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:28,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:28,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:49:28,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072936604] [2021-12-27 23:49:28,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:28,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:49:28,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:49:28,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:49:28,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:49:28,092 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:29,122 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2021-12-27 23:49:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:49:29,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-27 23:49:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:29,124 INFO L225 Difference]: With dead ends: 66 [2021-12-27 23:49:29,124 INFO L226 Difference]: Without dead ends: 42 [2021-12-27 23:49:29,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:49:29,125 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:29,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-27 23:49:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-27 23:49:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2021-12-27 23:49:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 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-27 23:49:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-12-27 23:49:29,133 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 11 [2021-12-27 23:49:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:29,134 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-12-27 23:49:29,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-12-27 23:49:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-27 23:49:29,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:29,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:29,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-27 23:49:29,347 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-27 23:49:29,347 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1843657908, now seen corresponding path program 1 times [2021-12-27 23:49:29,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:49:29,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084630634] [2021-12-27 23:49:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:29,348 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:49:29,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:49:29,349 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-27 23:49:29,350 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-27 23:49:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:29,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-27 23:49:29,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:29,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-27 23:49:29,705 INFO L387 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-27 23:49:29,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:29,792 INFO L387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-12-27 23:49:29,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:29,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:29,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:29,811 INFO L387 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 19 treesize of output 18 [2021-12-27 23:49:29,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:29,838 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-27 23:49:29,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-27 23:49:29,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:29,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:30,026 INFO L353 Elim1Store]: treesize reduction 215, result has 4.9 percent of original size [2021-12-27 23:49:30,027 INFO L387 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 3 case distinctions, treesize of input 48 treesize of output 49 [2021-12-27 23:49:30,048 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-27 23:49:30,049 INFO L387 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 19 treesize of output 21 [2021-12-27 23:49:30,099 INFO L387 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-27 23:49:30,111 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-27 23:49:30,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:49:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:49:33,502 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:49:33,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084630634] [2021-12-27 23:49:33,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084630634] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:49:33,502 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:49:33,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-27 23:49:33,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948629735] [2021-12-27 23:49:33,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:49:33,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 23:49:33,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:49:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 23:49:33,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=47, Unknown=4, NotChecked=0, Total=72 [2021-12-27 23:49:33,504 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:35,741 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-12-27 23:49:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 23:49:35,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-27 23:49:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:35,742 INFO L225 Difference]: With dead ends: 49 [2021-12-27 23:49:35,742 INFO L226 Difference]: Without dead ends: 47 [2021-12-27 23:49:35,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=28, Invalid=58, Unknown=4, NotChecked=0, Total=90 [2021-12-27 23:49:35,747 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:35,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 161 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 40 Unchecked, 2.2s Time] [2021-12-27 23:49:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-27 23:49:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2021-12-27 23:49:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 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-27 23:49:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-12-27 23:49:35,755 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2021-12-27 23:49:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:35,756 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-12-27 23:49:35,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-12-27 23:49:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-27 23:49:35,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:35,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:35,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-27 23:49:35,970 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-27 23:49:35,971 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1359067491, now seen corresponding path program 1 times [2021-12-27 23:49:35,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:49:35,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875520244] [2021-12-27 23:49:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:35,972 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:49:35,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:49:35,974 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-27 23:49:35,975 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-27 23:49:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:36,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-27 23:49:36,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:36,241 INFO L387 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-27 23:49:36,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:36,327 INFO L387 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 72 treesize of output 71 [2021-12-27 23:49:36,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:36,338 INFO L387 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 36 treesize of output 35 [2021-12-27 23:49:36,356 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-27 23:49:36,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2021-12-27 23:49:36,382 INFO L353 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2021-12-27 23:49:36,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 30 [2021-12-27 23:49:36,388 INFO L387 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 17 treesize of output 13 [2021-12-27 23:49:36,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:36,395 INFO L387 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-27 23:49:36,408 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-27 23:49:36,409 INFO L387 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-27 23:49:36,419 INFO L387 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 12 treesize of output 11 [2021-12-27 23:49:36,556 INFO L387 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 27 treesize of output 15 [2021-12-27 23:49:36,561 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-27 23:49:36,580 INFO L387 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-27 23:49:36,592 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-27 23:49:36,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:49:36,593 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:49:36,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875520244] [2021-12-27 23:49:36,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875520244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:49:36,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:49:36,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 23:49:36,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844185153] [2021-12-27 23:49:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:49:36,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 23:49:36,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:49:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 23:49:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 23:49:36,595 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:37,491 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-12-27 23:49:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 23:49:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-27 23:49:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:37,492 INFO L225 Difference]: With dead ends: 52 [2021-12-27 23:49:37,492 INFO L226 Difference]: Without dead ends: 50 [2021-12-27 23:49:37,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-27 23:49:37,493 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:37,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 102 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-27 23:49:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-27 23:49:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2021-12-27 23:49:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-12-27 23:49:37,498 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 15 [2021-12-27 23:49:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:37,498 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-12-27 23:49:37,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-12-27 23:49:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 23:49:37,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:37,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:37,515 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-27 23:49:37,715 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-27 23:49:37,715 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1751391308, now seen corresponding path program 1 times [2021-12-27 23:49:37,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:49:37,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36243833] [2021-12-27 23:49:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:37,716 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:49:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:49:37,717 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-27 23:49:37,718 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-27 23:49:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:38,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-27 23:49:38,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:38,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-27 23:49:38,120 INFO L387 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-27 23:49:38,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,162 INFO L387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2021-12-27 23:49:38,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:38,176 INFO L387 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 19 treesize of output 18 [2021-12-27 23:49:38,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,204 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-27 23:49:38,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-27 23:49:38,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,449 INFO L353 Elim1Store]: treesize reduction 208, result has 20.9 percent of original size [2021-12-27 23:49:38,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 450 treesize of output 326 [2021-12-27 23:49:38,482 INFO L387 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 177 treesize of output 131 [2021-12-27 23:49:38,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:38,517 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:49:38,518 INFO L387 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 17 treesize of output 15 [2021-12-27 23:49:38,539 INFO L387 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 8 treesize of output 7 [2021-12-27 23:49:39,217 INFO L387 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 8 treesize of output 7 [2021-12-27 23:49:39,291 INFO L387 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 8 treesize of output 7 [2021-12-27 23:49:39,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:39,665 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-27 23:49:39,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 58 [2021-12-27 23:49:39,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:39,738 INFO L387 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2021-12-27 23:49:39,781 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:49:39,782 INFO L387 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2021-12-27 23:49:39,867 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-27 23:49:39,867 INFO L387 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 22 treesize of output 14 [2021-12-27 23:49:39,891 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-27 23:49:39,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 23:49:39,967 INFO L387 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 288 treesize of output 284 [2021-12-27 23:49:39,976 INFO L387 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 362 treesize of output 354 [2021-12-27 23:49:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:49:46,056 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:49:46,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36243833] [2021-12-27 23:49:46,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36243833] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 23:49:46,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 23:49:46,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-27 23:49:46,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281492776] [2021-12-27 23:49:46,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 23:49:46,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 23:49:46,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:49:46,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 23:49:46,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=64, Unknown=3, NotChecked=0, Total=90 [2021-12-27 23:49:46,058 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:47,531 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1097 (_ BitVec 32))) (or (let ((.cse0 (= v_ArrVal_1097 |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (not .cse0) (and (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1108))) (store .cse1 v_ArrVal_1097 (store (select (store .cse1 v_ArrVal_1097 v_ArrVal_1116) v_arrayElimCell_49) (_ bv8 32) (_ bv2 32)))) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32))) (_ bv1 32)))) (forall ((v_arrayElimCell_49 (_ BitVec 32)) (v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1108) v_ArrVal_1097 v_ArrVal_1116))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 v_arrayElimCell_49) (_ bv12 32) (_ bv2 32)))) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))))) (or (forall ((v_arrayElimCell_48 (_ BitVec 32)) (v_ArrVal_1116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1108 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1108))) (store .cse3 v_ArrVal_1097 (store (select (store .cse3 v_ArrVal_1097 v_ArrVal_1116) v_arrayElimCell_48) (_ bv8 32) (_ bv2 32)))) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv8 32)))))) .cse0))) (not (= (select |c_#valid| v_ArrVal_1097) (_ bv0 1))))) (not (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 32)))) is different from false [2021-12-27 23:49:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:49:48,078 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-27 23:49:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 23:49:48,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-27 23:49:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:49:48,079 INFO L225 Difference]: With dead ends: 84 [2021-12-27 23:49:48,079 INFO L226 Difference]: Without dead ends: 68 [2021-12-27 23:49:48,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=4, NotChecked=18, Total=132 [2021-12-27 23:49:48,080 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-27 23:49:48,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 126 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 35 Unchecked, 1.8s Time] [2021-12-27 23:49:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-27 23:49:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2021-12-27 23:49:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2021-12-27 23:49:48,087 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 18 [2021-12-27 23:49:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:49:48,087 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2021-12-27 23:49:48,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 23:49:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2021-12-27 23:49:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-27 23:49:48,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:49:48,089 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:49:48,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-27 23:49:48,303 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-27 23:49:48,304 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-12-27 23:49:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:49:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1454377661, now seen corresponding path program 1 times [2021-12-27 23:49:48,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:49:48,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672966352] [2021-12-27 23:49:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:49:48,306 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:49:48,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:49:48,307 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-27 23:49:48,310 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-27 23:49:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:49:48,694 WARN L261 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-27 23:49:48,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:49:48,716 INFO L387 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-27 23:49:48,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:48,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:48,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2021-12-27 23:49:48,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:48,845 INFO L387 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 18 treesize of output 17 [2021-12-27 23:49:48,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:48,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-27 23:49:48,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:48,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-27 23:49:48,981 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-27 23:49:48,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-27 23:49:48,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-27 23:49:49,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:50,797 INFO L353 Elim1Store]: treesize reduction 199, result has 23.8 percent of original size [2021-12-27 23:49:50,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1281 treesize of output 1087 [2021-12-27 23:49:50,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 916 treesize of output 635 [2021-12-27 23:49:50,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:50,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:50,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:50,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-27 23:49:50,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-27 23:49:51,265 INFO L353 Elim1Store]: treesize reduction 89, result has 51.1 percent of original size [2021-12-27 23:49:51,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 471 treesize of output 554 [2021-12-27 23:49:51,299 INFO L387 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 401 treesize of output 406 [2021-12-27 23:49:51,330 INFO L190 IndexEqualityManager]: detected not equals via solver