./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:14:14,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:14:14,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:14:14,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:14:14,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:14:14,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:14:14,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:14:14,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:14:14,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:14:14,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:14:14,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:14:14,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:14:14,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:14:14,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:14:14,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:14:14,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:14:14,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:14:14,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:14:14,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:14:14,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:14:14,605 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:14:14,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:14:14,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:14:14,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:14:14,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:14:14,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:14:14,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:14:14,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:14:14,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:14:14,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:14:14,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:14:14,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:14:14,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:14:14,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:14:14,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:14:14,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:14:14,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:14:14,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:14:14,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:14:14,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:14:14,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:14:14,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:14:14,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:14:14,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:14:14,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:14:14,645 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:14:14,646 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:14:14,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:14:14,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:14:14,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:14:14,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:14:14,647 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:14:14,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:14:14,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:14:14,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:14:14,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:14:14,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:14:14,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:14:14,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:14:14,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:14:14,650 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:14:14,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:14:14,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:14:14,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:14:14,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:14:14,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:14:14,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:14:14,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:14:14,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:14:14,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:14:14,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:14:14,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:14:14,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:14:14,652 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:14:14,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:14:14,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:14:14,653 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-12 03:14:14,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:14:14,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:14:14,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:14:14,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:14:14,951 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:14:14,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-12 03:14:15,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701fc088e/11de871eaf3144f9963ccb0f7f229d5a/FLAG3296b4a91 [2022-07-12 03:14:15,434 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:14:15,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-12 03:14:15,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701fc088e/11de871eaf3144f9963ccb0f7f229d5a/FLAG3296b4a91 [2022-07-12 03:14:15,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701fc088e/11de871eaf3144f9963ccb0f7f229d5a [2022-07-12 03:14:15,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:14:15,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:14:15,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:14:15,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:14:15,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:14:15,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:15,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612e9483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15, skipping insertion in model container [2022-07-12 03:14:15,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:15,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:14:15,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:14:15,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-12 03:14:15,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:14:15,868 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:14:15,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-07-12 03:14:15,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:14:15,954 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:14:15,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15 WrapperNode [2022-07-12 03:14:15,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:14:15,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:14:15,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:14:15,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:14:15,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:15,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,013 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-07-12 03:14:16,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:14:16,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:14:16,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:14:16,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:14:16,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:14:16,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:14:16,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:14:16,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:14:16,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (1/1) ... [2022-07-12 03:14:16,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:14:16,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:16,084 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) [2022-07-12 03:14:16,089 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 [2022-07-12 03:14:16,118 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-12 03:14:16,118 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-12 03:14:16,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 03:14:16,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 03:14:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:14:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:14:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:14:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:14:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:14:16,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:14:16,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:14:16,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:14:16,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:14:16,200 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:14:16,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:14:16,409 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:14:16,423 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:14:16,423 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 03:14:16,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:14:16 BoogieIcfgContainer [2022-07-12 03:14:16,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:14:16,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:14:16,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:14:16,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:14:16,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:14:15" (1/3) ... [2022-07-12 03:14:16,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c31a0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:14:16, skipping insertion in model container [2022-07-12 03:14:16,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:14:15" (2/3) ... [2022-07-12 03:14:16,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c31a0c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:14:16, skipping insertion in model container [2022-07-12 03:14:16,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:14:16" (3/3) ... [2022-07-12 03:14:16,435 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-12 03:14:16,447 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:14:16,448 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:14:16,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:14:16,508 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@de45e91, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b0c59ae [2022-07-12 03:14:16,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:14:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 03:14:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:14:16,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:16,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:16,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2022-07-12 03:14:16,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:16,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652918824] [2022-07-12 03:14:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:16,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:16,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652918824] [2022-07-12 03:14:16,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652918824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:16,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:16,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:14:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134060697] [2022-07-12 03:14:16,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:16,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:14:16,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:16,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:14:16,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:14:16,792 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:14:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:16,816 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-07-12 03:14:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:14:16,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-12 03:14:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:16,824 INFO L225 Difference]: With dead ends: 77 [2022-07-12 03:14:16,824 INFO L226 Difference]: Without dead ends: 37 [2022-07-12 03:14:16,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:14:16,831 INFO L413 NwaCegarLoop]: 54 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, 54 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 [2022-07-12 03:14:16,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-12 03:14:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-12 03:14:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 03:14:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-07-12 03:14:16,869 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2022-07-12 03:14:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:16,869 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-07-12 03:14:16,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:14:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-07-12 03:14:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:14:16,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:16,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:16,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:14:16,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2022-07-12 03:14:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:16,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993471346] [2022-07-12 03:14:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:17,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:17,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993471346] [2022-07-12 03:14:17,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993471346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:17,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:17,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:14:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428596962] [2022-07-12 03:14:17,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:17,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:14:17,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:17,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:14:17,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:14:17,018 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:14:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:17,079 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-12 03:14:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:14:17,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-12 03:14:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:17,081 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:14:17,081 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:14:17,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:14:17,083 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:17,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:14:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-12 03:14:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 03:14:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-07-12 03:14:17,094 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2022-07-12 03:14:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:17,095 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-07-12 03:14:17,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:14:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-07-12 03:14:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:14:17,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:17,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:17,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:14:17,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:17,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2022-07-12 03:14:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:17,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647944754] [2022-07-12 03:14:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:17,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 03:14:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:14:17,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:17,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647944754] [2022-07-12 03:14:17,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647944754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:17,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:17,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:14:17,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746691780] [2022-07-12 03:14:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:17,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:14:17,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:17,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:14:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:14:17,230 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:14:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:17,283 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-07-12 03:14:17,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:14:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-12 03:14:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:17,285 INFO L225 Difference]: With dead ends: 86 [2022-07-12 03:14:17,285 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 03:14:17,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:14:17,287 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:17,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 134 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 03:14:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-07-12 03:14:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 44 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 03:14:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-07-12 03:14:17,309 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2022-07-12 03:14:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:17,310 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-07-12 03:14:17,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:14:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-07-12 03:14:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:14:17,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:17,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:17,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:14:17,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2022-07-12 03:14:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:17,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19611332] [2022-07-12 03:14:17,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 03:14:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:14:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:14:17,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:17,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19611332] [2022-07-12 03:14:17,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19611332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:17,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663322702] [2022-07-12 03:14:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:17,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:17,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:17,452 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) [2022-07-12 03:14:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:14:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:17,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:14:17,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:14:17,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:14:17,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663322702] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:17,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:14:17,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-12 03:14:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554897380] [2022-07-12 03:14:17,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:17,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 03:14:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 03:14:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:14:17,929 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 03:14:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:18,207 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2022-07-12 03:14:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:14:18,208 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-07-12 03:14:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:18,217 INFO L225 Difference]: With dead ends: 118 [2022-07-12 03:14:18,217 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 03:14:18,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-12 03:14:18,220 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:18,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 338 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:14:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 03:14:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-07-12 03:14:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 52 states have internal predecessors, (66), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 03:14:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-07-12 03:14:18,232 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2022-07-12 03:14:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:18,233 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-07-12 03:14:18,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 03:14:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-07-12 03:14:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 03:14:18,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:18,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:18,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:18,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:18,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:18,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2022-07-12 03:14:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:18,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425163749] [2022-07-12 03:14:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 03:14:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:18,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 03:14:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:14:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425163749] [2022-07-12 03:14:18,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425163749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:18,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:18,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:14:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919559598] [2022-07-12 03:14:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:18,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:14:18,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:14:18,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:14:18,631 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:14:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:18,704 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-07-12 03:14:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:14:18,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-07-12 03:14:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:18,706 INFO L225 Difference]: With dead ends: 75 [2022-07-12 03:14:18,706 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 03:14:18,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:14:18,708 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:18,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 03:14:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-12 03:14:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-12 03:14:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-07-12 03:14:18,720 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2022-07-12 03:14:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:18,721 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-07-12 03:14:18,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:14:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-07-12 03:14:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:14:18,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:18,723 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:18,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:14:18,723 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2022-07-12 03:14:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:18,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688095371] [2022-07-12 03:14:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:18,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 03:14:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:18,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 03:14:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 03:14:18,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:18,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688095371] [2022-07-12 03:14:18,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688095371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:18,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943416758] [2022-07-12 03:14:18,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:18,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:18,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:18,856 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) [2022-07-12 03:14:18,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:14:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:18,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 03:14:19,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:19,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:19,082 INFO L390 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 19 treesize of output 23 [2022-07-12 03:14:19,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:19,101 INFO L390 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 19 treesize of output 23 [2022-07-12 03:14:19,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:19,110 INFO L390 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 [2022-07-12 03:14:19,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:19,117 INFO L390 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 [2022-07-12 03:14:19,246 INFO L390 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 [2022-07-12 03:14:19,249 INFO L390 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 [2022-07-12 03:14:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:14:19,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:19,338 INFO L390 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 10 treesize of output 4 [2022-07-12 03:14:19,450 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:14:19,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-12 03:14:19,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-12 03:14:19,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:14:19,465 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-07-12 03:14:19,465 INFO L390 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 25 treesize of output 1 [2022-07-12 03:14:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 03:14:19,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943416758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:19,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:14:19,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-07-12 03:14:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042570934] [2022-07-12 03:14:19,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:19,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 03:14:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 03:14:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:14:19,494 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-12 03:14:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:20,028 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2022-07-12 03:14:20,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 03:14:20,030 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2022-07-12 03:14:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:20,036 INFO L225 Difference]: With dead ends: 269 [2022-07-12 03:14:20,036 INFO L226 Difference]: Without dead ends: 198 [2022-07-12 03:14:20,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-07-12 03:14:20,038 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 193 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:20,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 881 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 381 Invalid, 0 Unknown, 55 Unchecked, 0.3s Time] [2022-07-12 03:14:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-12 03:14:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 90. [2022-07-12 03:14:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 74 states have internal predecessors, (92), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-12 03:14:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2022-07-12 03:14:20,064 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 37 [2022-07-12 03:14:20,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:20,064 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2022-07-12 03:14:20,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-12 03:14:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2022-07-12 03:14:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:14:20,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:20,067 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:20,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:14:20,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 03:14:20,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:20,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2022-07-12 03:14:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:20,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770935622] [2022-07-12 03:14:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:20,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 03:14:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:14:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:14:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:20,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770935622] [2022-07-12 03:14:20,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770935622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:20,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:20,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:14:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316707843] [2022-07-12 03:14:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:20,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:14:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:20,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:14:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:14:20,380 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:14:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:20,489 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-07-12 03:14:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:14:20,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-12 03:14:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:20,491 INFO L225 Difference]: With dead ends: 133 [2022-07-12 03:14:20,491 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 03:14:20,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:14:20,493 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:20,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 165 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:14:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 03:14:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-07-12 03:14:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.323943661971831) internal successors, (94), 76 states have internal predecessors, (94), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-12 03:14:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2022-07-12 03:14:20,525 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 35 [2022-07-12 03:14:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:20,525 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2022-07-12 03:14:20,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:14:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2022-07-12 03:14:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:14:20,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:20,532 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:20,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 03:14:20,533 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2022-07-12 03:14:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:20,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557523826] [2022-07-12 03:14:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 03:14:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:14:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:14:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557523826] [2022-07-12 03:14:20,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557523826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:20,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:20,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:14:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215775927] [2022-07-12 03:14:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:20,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:14:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:14:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:14:20,625 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:14:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:20,663 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2022-07-12 03:14:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:14:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-07-12 03:14:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:20,665 INFO L225 Difference]: With dead ends: 99 [2022-07-12 03:14:20,665 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 03:14:20,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:14:20,666 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:20,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:20,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 03:14:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-12 03:14:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 66 states have internal predecessors, (84), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-12 03:14:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2022-07-12 03:14:20,688 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 35 [2022-07-12 03:14:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:20,688 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2022-07-12 03:14:20,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:14:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2022-07-12 03:14:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:14:20,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:20,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:20,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 03:14:20,692 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2022-07-12 03:14:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:20,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280066257] [2022-07-12 03:14:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 03:14:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:14:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:14:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:20,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280066257] [2022-07-12 03:14:20,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280066257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:20,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:20,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:14:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992655869] [2022-07-12 03:14:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:20,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:14:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:20,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:14:20,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:14:20,769 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:14:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:20,826 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-07-12 03:14:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:14:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-12 03:14:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:20,828 INFO L225 Difference]: With dead ends: 130 [2022-07-12 03:14:20,828 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:14:20,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:14:20,839 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:20,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:14:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-07-12 03:14:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-12 03:14:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2022-07-12 03:14:20,852 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 36 [2022-07-12 03:14:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:20,852 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2022-07-12 03:14:20,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 03:14:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2022-07-12 03:14:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 03:14:20,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:20,854 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:20,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 03:14:20,854 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash -827934680, now seen corresponding path program 1 times [2022-07-12 03:14:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:20,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65485017] [2022-07-12 03:14:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:20,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:14:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 03:14:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:21,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:14:21,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:21,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65485017] [2022-07-12 03:14:21,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65485017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:21,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183831464] [2022-07-12 03:14:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:21,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:21,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:21,081 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) [2022-07-12 03:14:21,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:14:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:21,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 03:14:21,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:21,239 INFO L390 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 [2022-07-12 03:14:21,269 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:14:21,269 INFO L390 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 [2022-07-12 03:14:21,307 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-12 03:14:21,307 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-07-12 03:14:21,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 03:14:21,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-12 03:14:21,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:21,347 INFO L390 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 63 treesize of output 13 [2022-07-12 03:14:21,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:14:21,382 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse1 (select v_DerPreprocessor_3 .cse0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) .cse1) (not (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse1)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (and (not (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from true [2022-07-12 03:14:21,422 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (and (not (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) (= .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse2 (select v_DerPreprocessor_3 .cse1))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) .cse2) (not (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))))) is different from true [2022-07-12 03:14:21,459 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4)) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse0 (select v_DerPreprocessor_3 .cse1))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|) .cse1))))))) is different from true [2022-07-12 03:14:21,821 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-07-12 03:14:21,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 87 [2022-07-12 03:14:21,828 INFO L390 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 19 treesize of output 11 [2022-07-12 03:14:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-07-12 03:14:21,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:14:21,988 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:14:21,989 INFO L390 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 124 treesize of output 127 [2022-07-12 03:14:21,993 INFO L390 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 152 treesize of output 144 [2022-07-12 03:14:21,997 INFO L390 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 144 treesize of output 140 [2022-07-12 03:14:22,040 INFO L390 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 8 treesize of output 4 [2022-07-12 03:14:22,048 INFO L390 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 26 [2022-07-12 03:14:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 03:14:22,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183831464] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:14:22,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:14:22,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 25 [2022-07-12 03:14:22,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510060372] [2022-07-12 03:14:22,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:14:22,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 03:14:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:22,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 03:14:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=12, NotChecked=126, Total=600 [2022-07-12 03:14:22,156 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 25 states, 22 states have (on average 2.772727272727273) internal successors, (61), 24 states have internal predecessors, (61), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 03:14:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:22,630 INFO L93 Difference]: Finished difference Result 186 states and 269 transitions. [2022-07-12 03:14:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:14:22,631 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.772727272727273) internal successors, (61), 24 states have internal predecessors, (61), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 46 [2022-07-12 03:14:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:22,632 INFO L225 Difference]: With dead ends: 186 [2022-07-12 03:14:22,633 INFO L226 Difference]: Without dead ends: 145 [2022-07-12 03:14:22,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=775, Unknown=21, NotChecked=180, Total=1122 [2022-07-12 03:14:22,634 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 133 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:22,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 555 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 271 Invalid, 0 Unknown, 492 Unchecked, 0.2s Time] [2022-07-12 03:14:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-12 03:14:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2022-07-12 03:14:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 79 states have internal predecessors, (98), 15 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (27), 14 states have call predecessors, (27), 14 states have call successors, (27) [2022-07-12 03:14:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2022-07-12 03:14:22,649 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 46 [2022-07-12 03:14:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:22,649 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2022-07-12 03:14:22,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.772727272727273) internal successors, (61), 24 states have internal predecessors, (61), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 03:14:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2022-07-12 03:14:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 03:14:22,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:22,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:22,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 03:14:22,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:22,869 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:22,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:22,870 INFO L85 PathProgramCache]: Analyzing trace with hash 828672736, now seen corresponding path program 1 times [2022-07-12 03:14:22,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:22,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592168933] [2022-07-12 03:14:22,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:22,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 03:14:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:14:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 03:14:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:22,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592168933] [2022-07-12 03:14:22,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592168933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:14:22,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:14:22,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:14:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846297707] [2022-07-12 03:14:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:14:22,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:14:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:14:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:14:22,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:14:22,956 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 03:14:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:14:23,016 INFO L93 Difference]: Finished difference Result 123 states and 175 transitions. [2022-07-12 03:14:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:14:23,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-12 03:14:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:14:23,018 INFO L225 Difference]: With dead ends: 123 [2022-07-12 03:14:23,018 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 03:14:23,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:14:23,019 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:14:23,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 331 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:14:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 03:14:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2022-07-12 03:14:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 81 states have internal predecessors, (100), 15 states have call successors, (15), 5 states have call predecessors, (15), 10 states have return successors, (35), 15 states have call predecessors, (35), 14 states have call successors, (35) [2022-07-12 03:14:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2022-07-12 03:14:23,035 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 44 [2022-07-12 03:14:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:14:23,036 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2022-07-12 03:14:23,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 03:14:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2022-07-12 03:14:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 03:14:23,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:14:23,037 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:14:23,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 03:14:23,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:14:23,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:14:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 1 times [2022-07-12 03:14:23,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:14:23,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721528015] [2022-07-12 03:14:23,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:23,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:14:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 03:14:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:23,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:14:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:23,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:14:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 03:14:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:14:23,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721528015] [2022-07-12 03:14:23,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721528015] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:14:23,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146422087] [2022-07-12 03:14:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:14:23,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:14:23,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:14:23,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:14:23,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:14:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:14:23,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-12 03:14:23,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:14:23,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:23,640 INFO L390 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 19 treesize of output 23 [2022-07-12 03:14:23,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:23,644 INFO L390 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 [2022-07-12 03:14:23,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:23,649 INFO L390 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 19 treesize of output 23 [2022-07-12 03:14:23,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:23,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:14:24,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:24,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:24,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:14:24,043 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 03:14:24,044 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 62 [2022-07-12 03:14:24,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:24,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:14:24,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2022-07-12 03:14:35,248 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:14:43,152 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:14:53,383 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:15:03,267 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:15:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:15:03,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:03,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146422087] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:03,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:15:03,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 33 [2022-07-12 03:15:03,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616862378] [2022-07-12 03:15:03,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:03,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 03:15:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:03,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 03:15:03,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=994, Unknown=7, NotChecked=0, Total=1122 [2022-07-12 03:15:03,638 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 03:15:16,873 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:15:27,125 WARN L233 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 66 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:15:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:27,609 INFO L93 Difference]: Finished difference Result 279 states and 432 transitions. [2022-07-12 03:15:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 03:15:27,609 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 50 [2022-07-12 03:15:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:27,611 INFO L225 Difference]: With dead ends: 279 [2022-07-12 03:15:27,611 INFO L226 Difference]: Without dead ends: 228 [2022-07-12 03:15:27,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 62.4s TimeCoverageRelationStatistics Valid=402, Invalid=3006, Unknown=14, NotChecked=0, Total=3422 [2022-07-12 03:15:27,613 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 164 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:27,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 920 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 958 Invalid, 0 Unknown, 306 Unchecked, 0.8s Time] [2022-07-12 03:15:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-12 03:15:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 150. [2022-07-12 03:15:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 120 states have internal predecessors, (146), 22 states have call successors, (22), 7 states have call predecessors, (22), 15 states have return successors, (53), 22 states have call predecessors, (53), 21 states have call successors, (53) [2022-07-12 03:15:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2022-07-12 03:15:27,635 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 50 [2022-07-12 03:15:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:27,636 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2022-07-12 03:15:27,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 03:15:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2022-07-12 03:15:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:15:27,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:27,639 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:27,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:27,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:27,852 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:27,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash -13848694, now seen corresponding path program 1 times [2022-07-12 03:15:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:27,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75672659] [2022-07-12 03:15:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:27,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:27,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 03:15:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:27,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:15:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:27,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:15:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:27,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:15:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 03:15:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:27,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75672659] [2022-07-12 03:15:27,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75672659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:27,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132581263] [2022-07-12 03:15:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:27,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:27,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:27,976 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:15:27,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:15:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:28,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 03:15:28,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:28,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:28,154 INFO L390 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 19 treesize of output 23 [2022-07-12 03:15:28,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:28,178 INFO L390 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 [2022-07-12 03:15:28,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 03:15:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 03:15:28,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:28,396 INFO L390 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 10 treesize of output 4 [2022-07-12 03:15:28,496 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:28,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-12 03:15:28,499 INFO L390 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 30 treesize of output 22 [2022-07-12 03:15:28,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:15:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 03:15:28,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132581263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:28,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:28,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-07-12 03:15:28,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228840049] [2022-07-12 03:15:28,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:28,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:15:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:15:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-07-12 03:15:28,556 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 03:15:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:29,486 INFO L93 Difference]: Finished difference Result 301 states and 429 transitions. [2022-07-12 03:15:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 03:15:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 43 [2022-07-12 03:15:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:29,488 INFO L225 Difference]: With dead ends: 301 [2022-07-12 03:15:29,488 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 03:15:29,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=323, Invalid=1159, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 03:15:29,489 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 190 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:29,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 879 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 559 Invalid, 0 Unknown, 62 Unchecked, 0.4s Time] [2022-07-12 03:15:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 03:15:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 197. [2022-07-12 03:15:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 151 states have (on average 1.2582781456953642) internal successors, (190), 156 states have internal predecessors, (190), 26 states have call successors, (26), 14 states have call predecessors, (26), 19 states have return successors, (52), 26 states have call predecessors, (52), 24 states have call successors, (52) [2022-07-12 03:15:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2022-07-12 03:15:29,519 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 43 [2022-07-12 03:15:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:29,519 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2022-07-12 03:15:29,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 03:15:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2022-07-12 03:15:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 03:15:29,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:29,522 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:29,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:29,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 03:15:29,728 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:29,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash 191887930, now seen corresponding path program 1 times [2022-07-12 03:15:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:29,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481772928] [2022-07-12 03:15:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:15:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:29,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:15:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 03:15:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:29,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 03:15:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 03:15:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:29,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481772928] [2022-07-12 03:15:29,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481772928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:29,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713658779] [2022-07-12 03:15:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:29,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:29,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:29,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:15:29,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:15:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:29,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-12 03:15:29,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:30,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:30,020 INFO L390 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 19 treesize of output 23 [2022-07-12 03:15:30,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:15:30,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,033 INFO L390 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 19 treesize of output 23 [2022-07-12 03:15:30,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,042 INFO L390 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 [2022-07-12 03:15:30,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,204 INFO L356 Elim1Store]: treesize reduction 59, result has 32.2 percent of original size [2022-07-12 03:15:30,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 94 [2022-07-12 03:15:30,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 03:15:30,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:30,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:30,255 INFO L356 Elim1Store]: treesize reduction 92, result has 24.6 percent of original size [2022-07-12 03:15:30,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 58 [2022-07-12 03:15:30,277 INFO L390 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 16 treesize of output 15 [2022-07-12 03:15:30,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:15:30,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:30,346 INFO L356 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2022-07-12 03:15:30,346 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 70 [2022-07-12 03:15:30,350 INFO L390 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 60 treesize of output 40 [2022-07-12 03:15:32,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:32,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:32,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:32,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 170 case distinctions, treesize of input 399 treesize of output 1207 [2022-07-12 03:15:33,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:33,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 55 case distinctions, treesize of input 1219 treesize of output 1472 [2022-07-12 03:15:33,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-12 03:15:33,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-12 03:15:33,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5