./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 26d01a9c 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-?-26d01a9 [2023-02-17 00:26:29,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:26:29,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:26:29,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:26:29,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:26:29,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:26:29,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:26:29,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:26:29,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:26:29,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:26:29,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:26:29,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:26:29,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:26:29,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:26:29,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:26:29,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:26:29,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:26:29,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:26:29,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:26:29,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:26:29,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:26:29,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:26:29,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:26:29,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:26:29,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:26:29,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:26:29,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:26:29,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:26:29,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:26:29,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:26:29,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:26:29,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:26:29,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:26:29,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:26:29,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:26:29,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:26:29,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:26:29,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:26:29,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:26:29,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:26:29,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:26:29,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 00:26:29,160 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:26:29,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:26:29,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:26:29,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:26:29,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:26:29,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:26:29,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:26:29,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:26:29,162 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:26:29,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:26:29,162 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:26:29,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 00:26:29,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:26:29,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:26:29,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:26:29,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:26:29,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:26:29,163 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:26:29,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:26:29,164 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:26:29,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:26:29,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:26:29,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:26:29,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:26:29,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:26:29,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:26:29,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:26:29,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:26:29,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 00:26:29,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 00:26:29,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:26:29,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:26:29,166 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:26:29,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:26:29,166 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:26:29,166 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-17 00:26:29,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:26:29,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:26:29,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:26:29,392 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:26:29,392 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:26:29,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2023-02-17 00:26:30,438 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:26:30,610 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:26:30,610 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2023-02-17 00:26:30,617 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007046b09/2094fbe5061343559c3b9972b333e5ef/FLAG52843898e [2023-02-17 00:26:30,626 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/007046b09/2094fbe5061343559c3b9972b333e5ef [2023-02-17 00:26:30,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:26:30,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:26:30,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:26:30,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:26:30,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:26:30,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b16a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30, skipping insertion in model container [2023-02-17 00:26:30,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:26:30,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:26:30,761 WARN L237 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] [2023-02-17 00:26:30,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:26:30,862 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:26:30,870 WARN L237 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] [2023-02-17 00:26:30,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:26:30,919 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:26:30,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30 WrapperNode [2023-02-17 00:26:30,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:26:30,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:26:30,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:26:30,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:26:30,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,950 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2023-02-17 00:26:30,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:26:30,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:26:30,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:26:30,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:26:30,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,968 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:26:30,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:26:30,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:26:30,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:26:30,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (1/1) ... [2023-02-17 00:26:30,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:26:30,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:26:30,998 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) [2023-02-17 00:26:31,016 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 [2023-02-17 00:26:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2023-02-17 00:26:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2023-02-17 00:26:31,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 00:26:31,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 00:26:31,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 00:26:31,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:26:31,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 00:26:31,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 00:26:31,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 00:26:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 00:26:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 00:26:31,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:26:31,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:26:31,108 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:26:31,109 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:26:31,287 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:26:31,293 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:26:31,293 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 00:26:31,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:26:31 BoogieIcfgContainer [2023-02-17 00:26:31,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:26:31,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:26:31,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:26:31,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:26:31,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:26:30" (1/3) ... [2023-02-17 00:26:31,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521d9a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:26:31, skipping insertion in model container [2023-02-17 00:26:31,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:26:30" (2/3) ... [2023-02-17 00:26:31,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521d9a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:26:31, skipping insertion in model container [2023-02-17 00:26:31,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:26:31" (3/3) ... [2023-02-17 00:26:31,300 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2023-02-17 00:26:31,322 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:26:31,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:26:31,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:26:31,368 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c172ca3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:26:31,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:26:31,371 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) [2023-02-17 00:26:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 00:26:31,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:31,377 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] [2023-02-17 00:26:31,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2023-02-17 00:26:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:31,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454362926] [2023-02-17 00:26:31,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:31,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:26:31,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:31,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454362926] [2023-02-17 00:26:31,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454362926] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:26:31,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:26:31,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 00:26:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437404059] [2023-02-17 00:26:31,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:26:31,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 00:26:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 00:26:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 00:26:31,649 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) [2023-02-17 00:26:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:31,666 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2023-02-17 00:26:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 00:26:31,670 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 [2023-02-17 00:26:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:31,680 INFO L225 Difference]: With dead ends: 77 [2023-02-17 00:26:31,681 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 00:26:31,683 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 [2023-02-17 00:26:31,688 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 [2023-02-17 00:26:31,688 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] [2023-02-17 00:26:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 00:26:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-17 00:26:31,756 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) [2023-02-17 00:26:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-02-17 00:26:31,760 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2023-02-17 00:26:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:31,760 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-02-17 00:26:31,761 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) [2023-02-17 00:26:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-02-17 00:26:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 00:26:31,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:31,764 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] [2023-02-17 00:26:31,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 00:26:31,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:31,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:31,771 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2023-02-17 00:26:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:31,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198837412] [2023-02-17 00:26:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:26:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:31,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198837412] [2023-02-17 00:26:31,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198837412] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:26:31,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:26:31,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 00:26:31,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568574971] [2023-02-17 00:26:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:26:31,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 00:26:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:31,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 00:26:31,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 00:26:31,959 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) [2023-02-17 00:26:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:32,002 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-02-17 00:26:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 00:26:32,002 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 [2023-02-17 00:26:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:32,003 INFO L225 Difference]: With dead ends: 45 [2023-02-17 00:26:32,003 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 00:26:32,004 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 [2023-02-17 00:26:32,004 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 [2023-02-17 00:26:32,005 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] [2023-02-17 00:26:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 00:26:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-02-17 00:26:32,009 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) [2023-02-17 00:26:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-02-17 00:26:32,014 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2023-02-17 00:26:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:32,015 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-02-17 00:26:32,015 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) [2023-02-17 00:26:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-02-17 00:26:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 00:26:32,016 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:32,016 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] [2023-02-17 00:26:32,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 00:26:32,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:32,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2023-02-17 00:26:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:32,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798949752] [2023-02-17 00:26:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 00:26:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 00:26:32,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:32,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798949752] [2023-02-17 00:26:32,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798949752] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:26:32,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:26:32,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 00:26:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067985810] [2023-02-17 00:26:32,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:26:32,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 00:26:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:32,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 00:26:32,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 00:26:32,105 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) [2023-02-17 00:26:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:32,153 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2023-02-17 00:26:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 00:26:32,154 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 [2023-02-17 00:26:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:32,155 INFO L225 Difference]: With dead ends: 86 [2023-02-17 00:26:32,156 INFO L226 Difference]: Without dead ends: 63 [2023-02-17 00:26:32,157 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 [2023-02-17 00:26:32,158 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:26:32,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:26:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-17 00:26:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-02-17 00:26:32,168 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) [2023-02-17 00:26:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2023-02-17 00:26:32,171 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2023-02-17 00:26:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:32,172 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2023-02-17 00:26:32,172 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) [2023-02-17 00:26:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2023-02-17 00:26:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 00:26:32,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:32,174 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] [2023-02-17 00:26:32,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 00:26:32,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:32,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2023-02-17 00:26:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:32,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445704459] [2023-02-17 00:26:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:26:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-17 00:26:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:26:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445704459] [2023-02-17 00:26:32,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445704459] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:26:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746052495] [2023-02-17 00:26:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:32,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:26:32,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:26:32,364 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) [2023-02-17 00:26:32,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 00:26:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:32,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 00:26:32,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:26:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:26:32,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:26:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:26:32,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746052495] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:26:32,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:26:32,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-02-17 00:26:32,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396403446] [2023-02-17 00:26:32,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:26:32,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 00:26:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:32,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 00:26:32,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-02-17 00:26:32,587 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) [2023-02-17 00:26:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:32,775 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2023-02-17 00:26:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 00:26:32,776 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 [2023-02-17 00:26:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:32,778 INFO L225 Difference]: With dead ends: 118 [2023-02-17 00:26:32,778 INFO L226 Difference]: Without dead ends: 82 [2023-02-17 00:26:32,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-02-17 00:26:32,779 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:26:32,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 338 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:26:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-17 00:26:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2023-02-17 00:26:32,786 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) [2023-02-17 00:26:32,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2023-02-17 00:26:32,787 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2023-02-17 00:26:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:32,787 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2023-02-17 00:26:32,787 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) [2023-02-17 00:26:32,788 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2023-02-17 00:26:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 00:26:32,788 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:32,789 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] [2023-02-17 00:26:32,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 00:26:32,994 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 [2023-02-17 00:26:32,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2023-02-17 00:26:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:32,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738961188] [2023-02-17 00:26:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:26:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 00:26:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 00:26:33,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:33,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738961188] [2023-02-17 00:26:33,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738961188] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:26:33,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:26:33,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 00:26:33,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777520042] [2023-02-17 00:26:33,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:26:33,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 00:26:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 00:26:33,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 00:26:33,130 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) [2023-02-17 00:26:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:33,169 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2023-02-17 00:26:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:26:33,170 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 [2023-02-17 00:26:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:33,170 INFO L225 Difference]: With dead ends: 75 [2023-02-17 00:26:33,171 INFO L226 Difference]: Without dead ends: 73 [2023-02-17 00:26:33,171 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 [2023-02-17 00:26:33,172 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 [2023-02-17 00:26:33,172 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] [2023-02-17 00:26:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-17 00:26:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-02-17 00:26:33,178 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) [2023-02-17 00:26:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2023-02-17 00:26:33,179 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2023-02-17 00:26:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:33,179 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2023-02-17 00:26:33,179 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) [2023-02-17 00:26:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2023-02-17 00:26:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 00:26:33,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:33,181 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] [2023-02-17 00:26:33,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 00:26:33,181 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:33,181 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2023-02-17 00:26:33,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:33,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029572905] [2023-02-17 00:26:33,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:26:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 00:26:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:33,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 00:26:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029572905] [2023-02-17 00:26:33,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029572905] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:26:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718637003] [2023-02-17 00:26:33,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:33,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:26:33,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:26:33,289 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) [2023-02-17 00:26:33,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 00:26:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:33,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-17 00:26:33,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:26:33,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:33,421 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:33,427 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:33,433 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:33,438 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,493 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,496 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 00:26:33,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:26:33,510 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:33,548 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,551 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,553 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:33,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:33,557 INFO L350 Elim1Store]: Elim1 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 31 [2023-02-17 00:26:33,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:26:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 00:26:33,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718637003] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:26:33,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:26:33,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2023-02-17 00:26:33,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750760731] [2023-02-17 00:26:33,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:26:33,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 00:26:33,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:33,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 00:26:33,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-02-17 00:26:33,579 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) [2023-02-17 00:26:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:34,223 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2023-02-17 00:26:34,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 00:26:34,223 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 [2023-02-17 00:26:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:34,226 INFO L225 Difference]: With dead ends: 326 [2023-02-17 00:26:34,226 INFO L226 Difference]: Without dead ends: 253 [2023-02-17 00:26:34,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 00:26:34,227 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 243 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 00:26:34,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 852 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 00:26:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-17 00:26:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2023-02-17 00:26:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.316831683168317) internal successors, (133), 111 states have internal predecessors, (133), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (34), 16 states have call predecessors, (34), 20 states have call successors, (34) [2023-02-17 00:26:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2023-02-17 00:26:34,246 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 37 [2023-02-17 00:26:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:34,246 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2023-02-17 00:26:34,246 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) [2023-02-17 00:26:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2023-02-17 00:26:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 00:26:34,248 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:34,248 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] [2023-02-17 00:26:34,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 00:26:34,453 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 [2023-02-17 00:26:34,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2023-02-17 00:26:34,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:34,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299230984] [2023-02-17 00:26:34,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:34,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 00:26:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:26:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 00:26:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:34,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299230984] [2023-02-17 00:26:34,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299230984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:26:34,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:26:34,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 00:26:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876645809] [2023-02-17 00:26:34,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:26:34,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 00:26:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:34,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 00:26:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 00:26:34,658 INFO L87 Difference]: Start difference. First operand 136 states and 189 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) [2023-02-17 00:26:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:34,727 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2023-02-17 00:26:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 00:26:34,728 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 [2023-02-17 00:26:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:34,730 INFO L225 Difference]: With dead ends: 179 [2023-02-17 00:26:34,730 INFO L226 Difference]: Without dead ends: 148 [2023-02-17 00:26:34,731 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 [2023-02-17 00:26:34,731 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:26:34,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 165 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:26:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-17 00:26:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2023-02-17 00:26:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 113 states have internal predecessors, (135), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (34), 16 states have call predecessors, (34), 20 states have call successors, (34) [2023-02-17 00:26:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2023-02-17 00:26:34,757 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 35 [2023-02-17 00:26:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:34,757 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2023-02-17 00:26:34,757 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) [2023-02-17 00:26:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2023-02-17 00:26:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 00:26:34,761 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:34,761 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] [2023-02-17 00:26:34,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 00:26:34,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:34,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2023-02-17 00:26:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:34,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37681474] [2023-02-17 00:26:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:34,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 00:26:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:26:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 00:26:34,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:34,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37681474] [2023-02-17 00:26:34,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37681474] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:26:34,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:26:34,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 00:26:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317178878] [2023-02-17 00:26:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:26:34,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 00:26:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:34,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 00:26:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 00:26:34,829 INFO L87 Difference]: Start difference. First operand 138 states and 191 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) [2023-02-17 00:26:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:34,855 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2023-02-17 00:26:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 00:26:34,855 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 [2023-02-17 00:26:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:34,857 INFO L225 Difference]: With dead ends: 150 [2023-02-17 00:26:34,857 INFO L226 Difference]: Without dead ends: 138 [2023-02-17 00:26:34,858 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 [2023-02-17 00:26:34,859 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 [2023-02-17 00:26:34,859 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] [2023-02-17 00:26:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-17 00:26:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-02-17 00:26:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 93 states have internal predecessors, (115), 16 states have call successors, (16), 6 states have call predecessors, (16), 10 states have return successors, (24), 14 states have call predecessors, (24), 14 states have call successors, (24) [2023-02-17 00:26:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-02-17 00:26:34,873 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 35 [2023-02-17 00:26:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:34,873 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-02-17 00:26:34,874 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) [2023-02-17 00:26:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-02-17 00:26:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 00:26:34,875 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:34,875 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] [2023-02-17 00:26:34,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 00:26:34,875 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:34,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2023-02-17 00:26:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:34,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946029426] [2023-02-17 00:26:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:34,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 00:26:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:26:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 00:26:34,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:34,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946029426] [2023-02-17 00:26:34,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946029426] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:26:34,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:26:34,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 00:26:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352271510] [2023-02-17 00:26:34,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:26:34,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 00:26:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:34,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 00:26:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 00:26:34,995 INFO L87 Difference]: Start difference. First operand 114 states and 155 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) [2023-02-17 00:26:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:35,039 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2023-02-17 00:26:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 00:26:35,040 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 [2023-02-17 00:26:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:35,042 INFO L225 Difference]: With dead ends: 202 [2023-02-17 00:26:35,042 INFO L226 Difference]: Without dead ends: 94 [2023-02-17 00:26:35,043 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 [2023-02-17 00:26:35,044 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 [2023-02-17 00:26:35,045 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] [2023-02-17 00:26:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-17 00:26:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-17 00:26:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 73 states have internal predecessors, (88), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-17 00:26:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2023-02-17 00:26:35,053 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 36 [2023-02-17 00:26:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:35,054 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2023-02-17 00:26:35,054 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) [2023-02-17 00:26:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2023-02-17 00:26:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 00:26:35,054 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:35,055 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] [2023-02-17 00:26:35,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 00:26:35,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1426728412, now seen corresponding path program 1 times [2023-02-17 00:26:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:35,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498528305] [2023-02-17 00:26:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 00:26:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:35,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 00:26:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-17 00:26:35,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:35,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498528305] [2023-02-17 00:26:35,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498528305] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:26:35,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889213045] [2023-02-17 00:26:35,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:35,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:26:35,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:26:35,374 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) [2023-02-17 00:26:35,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 00:26:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:35,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-17 00:26:35,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:26:35,504 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:35,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:35,521 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-17 00:26:35,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:35,535 INFO L350 Elim1Store]: Elim1 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 108 [2023-02-17 00:26:35,541 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 22 [2023-02-17 00:26:35,546 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 40 [2023-02-17 00:26:35,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:26:35,555 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 35 [2023-02-17 00:26:35,557 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:26:35,582 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse0 (select .cse7 .cse3))) (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_3 .cse3))) (and (= .cse0 .cse1) (not (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse1)) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (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))) (and (= v_DerPreprocessor_2 .cse2) (= .cse2 (select |c_#memory_$Pointer$.base| .cse1)))))))) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_3 .cse3))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse6))) (and (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse6 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse6))) (and (= v_DerPreprocessor_2 .cse4) (= .cse4 .cse5) (= v_DerPreprocessor_3 .cse4)))) (= .cse0 .cse6) (= .cse7 .cse5) (not (= .cse6 |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse6)))))) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_3 .cse3))) (and (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse8 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse9 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse9))) (and (= v_DerPreprocessor_2 .cse8) (= .cse8 (select |c_#memory_$Pointer$.base| .cse9)) (= v_DerPreprocessor_3 .cse8)))) (= .cse0 .cse9) (not (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse9))))) (let ((.cse10 (select |c_#memory_$Pointer$.base| .cse0)) (.cse11 (= .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= .cse0 (select .cse10 .cse3)) (or (= .cse7 .cse10) (not .cse11)) (not (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) .cse11)) (exists ((v_DerPreprocessor_3 (Array Int Int))) (let ((.cse12 (select v_DerPreprocessor_3 .cse3))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse12))) (and (= .cse0 .cse12) (= .cse7 .cse13) (not (= .cse12 |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse12)) (exists ((v_DerPreprocessor_2 (Array Int Int))) (let ((.cse14 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse12 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse12))) (and (= v_DerPreprocessor_2 .cse14) (= .cse14 .cse13))))))))))) is different from true [2023-02-17 00:26:35,635 WARN L859 $PredicateComparison]: unable to prove that (or (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 ((.cse4 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse2 (select v_DerPreprocessor_3 .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse3 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse2)) (.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|))) (and (= .cse0 .cse1) (not (= .cse2 |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|)) (= .cse3 .cse0) (= .cse3 v_DerPreprocessor_2) (= .cse2 (select .cse1 .cse4))))))) (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 ((.cse9 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse7 (select v_DerPreprocessor_3 .cse9))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse7)) (.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|)) (.cse8 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse7 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse7))) (and (= .cse5 .cse6) (not (= .cse7 |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|)) (= .cse8 .cse5) (= .cse8 v_DerPreprocessor_2) (= .cse7 (select .cse6 .cse9)) (= .cse8 v_DerPreprocessor_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 ((.cse12 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse10 (select v_DerPreprocessor_3 .cse12))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse10))) (and (not (= .cse10 |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|)) (= .cse11 (select |c_#memory_$Pointer$.base| .cse10)) (= .cse11 v_DerPreprocessor_2) (= .cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|) .cse12))))))) (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 ((.cse15 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse13 (select v_DerPreprocessor_3 .cse15))) (let ((.cse14 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse13 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse13))) (and (not (= .cse13 |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|)) (= .cse14 (select |c_#memory_$Pointer$.base| .cse13)) (= .cse14 v_DerPreprocessor_2) (= .cse13 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|) .cse15)) (= .cse14 v_DerPreprocessor_3)))))) (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)) (let ((.cse17 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|)) (.cse19 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse18 (select .cse17 .cse19))) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse18))) (and (= .cse16 .cse17) (= .cse18 (select .cse16 .cse19)) (= .cse18 |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|))))))) is different from true [2023-02-17 00:26:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2023-02-17 00:26:36,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:26:36,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:36,259 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:36,263 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:36,265 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:36,270 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:36,272 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:36,275 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:36,278 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:36,280 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:36,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:26:36,282 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 00:26:44,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889213045] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:26:44,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:26:44,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 29 [2023-02-17 00:26:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103052345] [2023-02-17 00:26:44,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:26:44,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-17 00:26:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:26:44,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-17 00:26:44,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=613, Unknown=22, NotChecked=102, Total=812 [2023-02-17 00:26:44,377 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-17 00:26:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:26:47,158 INFO L93 Difference]: Finished difference Result 196 states and 267 transitions. [2023-02-17 00:26:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 00:26:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 46 [2023-02-17 00:26:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:26:47,160 INFO L225 Difference]: With dead ends: 196 [2023-02-17 00:26:47,160 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 00:26:47,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=503, Invalid=2336, Unknown=31, NotChecked=210, Total=3080 [2023-02-17 00:26:47,161 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 207 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 113 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:26:47,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 704 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 938 Invalid, 44 Unknown, 247 Unchecked, 2.1s Time] [2023-02-17 00:26:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 00:26:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 81. [2023-02-17 00:26:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.293103448275862) internal successors, (75), 65 states have internal predecessors, (75), 11 states have call successors, (11), 5 states have call predecessors, (11), 11 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-17 00:26:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2023-02-17 00:26:47,169 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 46 [2023-02-17 00:26:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:26:47,169 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2023-02-17 00:26:47,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 28 states have internal predecessors, (70), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-17 00:26:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2023-02-17 00:26:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 00:26:47,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:26:47,170 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] [2023-02-17 00:26:47,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 00:26:47,375 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 [2023-02-17 00:26:47,378 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:26:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:26:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash 803799756, now seen corresponding path program 1 times [2023-02-17 00:26:47,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:26:47,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089438034] [2023-02-17 00:26:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:47,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:26:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:26:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:47,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:47,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:26:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:26:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 00:26:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:26:47,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089438034] [2023-02-17 00:26:47,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089438034] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:26:47,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17705247] [2023-02-17 00:26:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:26:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:26:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:26:47,856 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) [2023-02-17 00:26:47,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 00:26:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:26:47,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 85 conjunts are in the unsatisfiable core [2023-02-17 00:26:47,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:26:48,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:48,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 00:26:48,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:48,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 00:26:48,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:48,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 00:26:48,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:48,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 00:26:48,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:26:48,165 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:26:48,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:48,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 57 [2023-02-17 00:26:48,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 72 [2023-02-17 00:26:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 00:26:48,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:26:48,469 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:48,587 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:48,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:48,745 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 140 [2023-02-17 00:26:48,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:48,747 INFO L350 Elim1Store]: Elim1 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 148 treesize of output 88 [2023-02-17 00:26:48,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:48,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 539 treesize of output 539 [2023-02-17 00:26:48,757 INFO L350 Elim1Store]: Elim1 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 663 treesize of output 627 [2023-02-17 00:26:48,776 INFO L350 Elim1Store]: Elim1 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 622 treesize of output 606 [2023-02-17 00:26:48,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:48,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 801 treesize of output 713 [2023-02-17 00:26:48,923 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:48,924 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:48,926 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:48,927 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,024 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,025 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,027 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,028 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,175 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,176 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,177 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,178 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,186 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,188 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,189 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,190 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,198 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,201 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,202 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,203 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,225 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,226 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,228 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,229 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,242 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,243 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,249 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,251 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,264 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,266 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,267 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,268 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,278 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,280 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,281 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,282 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,290 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,291 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,292 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,293 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,304 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,305 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,307 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,310 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,527 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,537 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,546 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,548 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,557 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,565 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,569 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,577 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,587 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,596 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,600 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,603 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,604 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,617 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:49,619 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,621 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,621 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,622 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,623 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,637 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:49,639 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,640 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,640 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,641 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,642 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,648 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,649 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,650 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,651 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,652 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,664 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:49,676 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,680 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,690 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,693 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,694 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,696 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,697 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,709 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,711 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,711 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,724 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,726 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,726 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,730 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,731 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,748 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,752 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,776 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,782 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,783 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,798 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,804 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,805 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,805 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,806 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,807 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,829 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,833 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,834 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,835 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,835 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,837 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,839 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,839 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,840 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,841 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,842 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,852 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,869 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,871 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,880 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,881 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,890 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,909 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,920 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,926 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,935 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,937 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,938 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,952 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,954 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,954 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,955 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,956 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,958 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,972 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,973 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,974 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,975 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,977 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,978 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,993 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,995 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,996 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,996 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,997 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:49,998 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,013 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,015 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,016 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,017 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,017 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,018 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,027 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,040 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:26:50,050 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,052 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,063 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,073 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,117 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,128 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,130 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,131 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,150 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,163 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,165 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,167 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,180 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,183 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,196 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,198 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,210 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,213 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,224 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,226 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,227 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,232 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,233 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,245 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,246 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,259 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,270 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,277 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,287 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,300 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,302 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,303 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,305 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,318 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,320 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,333 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,336 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,348 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,369 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,382 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,397 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,398 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,399 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,414 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,416 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,417 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,434 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,435 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,437 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,454 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,471 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,487 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,489 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,490 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,506 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,523 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,525 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,526 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,527 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,528 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,529 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,530 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,547 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,549 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,573 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,575 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,596 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,615 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,617 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,618 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,638 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,666 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,668 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,669 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,674 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,675 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,681 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,695 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,712 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,726 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,740 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,755 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,767 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,783 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,802 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,804 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,820 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,822 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,836 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,842 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,859 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,864 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,880 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,883 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:50,884 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-17 00:26:54,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:26:54,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72645 treesize of output 61621 [2023-02-17 00:27:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 00:27:12,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17705247] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:27:12,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:27:12,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2023-02-17 00:27:12,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438084611] [2023-02-17 00:27:12,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:27:12,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-17 00:27:12,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:27:12,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-17 00:27:12,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1497, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 00:27:12,123 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-17 00:27:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:27:14,622 INFO L93 Difference]: Finished difference Result 195 states and 252 transitions. [2023-02-17 00:27:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 00:27:14,622 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) Word has length 43 [2023-02-17 00:27:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:27:14,623 INFO L225 Difference]: With dead ends: 195 [2023-02-17 00:27:14,623 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 00:27:14,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=563, Invalid=4129, Unknown=0, NotChecked=0, Total=4692 [2023-02-17 00:27:14,625 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 219 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-17 00:27:14,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 807 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-17 00:27:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 00:27:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 117. [2023-02-17 00:27:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 92 states have internal predecessors, (104), 16 states have call successors, (16), 8 states have call predecessors, (16), 17 states have return successors, (29), 16 states have call predecessors, (29), 14 states have call successors, (29) [2023-02-17 00:27:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2023-02-17 00:27:14,654 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 43 [2023-02-17 00:27:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:27:14,654 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2023-02-17 00:27:14,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.081081081081081) internal successors, (77), 40 states have internal predecessors, (77), 12 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-17 00:27:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2023-02-17 00:27:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 00:27:14,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:27:14,656 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] [2023-02-17 00:27:14,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 00:27:14,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:27:14,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:27:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:27:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash 828672736, now seen corresponding path program 1 times [2023-02-17 00:27:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:27:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956887699] [2023-02-17 00:27:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:14,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:27:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:14,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:27:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:27:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:14,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:27:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:27:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-17 00:27:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:27:14,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956887699] [2023-02-17 00:27:14,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956887699] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:27:14,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:27:14,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 00:27:14,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612695253] [2023-02-17 00:27:14,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:27:14,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 00:27:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:27:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 00:27:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-17 00:27:14,966 INFO L87 Difference]: Start difference. First operand 117 states and 149 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) [2023-02-17 00:27:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:27:15,011 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2023-02-17 00:27:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 00:27:15,012 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 [2023-02-17 00:27:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:27:15,014 INFO L225 Difference]: With dead ends: 148 [2023-02-17 00:27:15,014 INFO L226 Difference]: Without dead ends: 146 [2023-02-17 00:27:15,015 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 [2023-02-17 00:27:15,015 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 317 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 [2023-02-17 00:27:15,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 317 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:27:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-17 00:27:15,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2023-02-17 00:27:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 92 states have internal predecessors, (106), 16 states have call successors, (16), 8 states have call predecessors, (16), 17 states have return successors, (29), 18 states have call predecessors, (29), 14 states have call successors, (29) [2023-02-17 00:27:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2023-02-17 00:27:15,025 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 44 [2023-02-17 00:27:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:27:15,026 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2023-02-17 00:27:15,026 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) [2023-02-17 00:27:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2023-02-17 00:27:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 00:27:15,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:27:15,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:27:15,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 00:27:15,027 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:27:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:27:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2023-02-17 00:27:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:27:15,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848264100] [2023-02-17 00:27:15,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:15,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:27:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:27:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:27:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:27:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 00:27:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 00:27:15,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:27:15,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848264100] [2023-02-17 00:27:15,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848264100] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:27:15,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143650341] [2023-02-17 00:27:15,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:15,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:27:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:27:15,127 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) [2023-02-17 00:27:15,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 00:27:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 00:27:15,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:27:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 00:27:15,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:27:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 00:27:15,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143650341] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:27:15,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:27:15,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-02-17 00:27:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670608371] [2023-02-17 00:27:15,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:27:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 00:27:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:27:15,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 00:27:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-17 00:27:15,274 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-17 00:27:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:27:15,390 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2023-02-17 00:27:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:27:15,390 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 46 [2023-02-17 00:27:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:27:15,391 INFO L225 Difference]: With dead ends: 193 [2023-02-17 00:27:15,391 INFO L226 Difference]: Without dead ends: 128 [2023-02-17 00:27:15,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-02-17 00:27:15,392 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:27:15,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 186 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:27:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-17 00:27:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2023-02-17 00:27:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 96 states have internal predecessors, (112), 16 states have call successors, (16), 12 states have call predecessors, (16), 17 states have return successors, (29), 18 states have call predecessors, (29), 14 states have call successors, (29) [2023-02-17 00:27:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2023-02-17 00:27:15,404 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 46 [2023-02-17 00:27:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:27:15,404 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2023-02-17 00:27:15,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-17 00:27:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2023-02-17 00:27:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 00:27:15,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:27:15,406 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] [2023-02-17 00:27:15,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 00:27:15,611 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 [2023-02-17 00:27:15,611 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:27:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:27:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 2 times [2023-02-17 00:27:15,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:27:15,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728035265] [2023-02-17 00:27:15,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:27:15,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:27:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:27:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:27:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:27:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:27:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:27:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:27:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-17 00:27:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:27:15,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728035265] [2023-02-17 00:27:15,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728035265] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:27:15,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136373463] [2023-02-17 00:27:15,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:27:15,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:27:15,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:27:15,999 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) [2023-02-17 00:27:16,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 00:27:16,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:27:16,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:27:16,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-17 00:27:16,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:27:16,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:27:16,138 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:27:16,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:27:16,141 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:27:16,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:27:16,144 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:27:16,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:27:16,147 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:27:16,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:27:16,303 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:27:16,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:27:16,304 INFO L350 Elim1Store]: Elim1 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 80 [2023-02-17 00:27:16,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:27:16,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:27:16,308 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:27:18,557 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_5| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_5|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| 4)) 0))) (exists ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_5| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_5|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_5| 4)) 0)))) (let ((.cse1 (+ 4 0))) (or (exists ((|ULTIMATE.start_remove_~x#1.base| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|))) (let ((.cse0 (select .cse4 0))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) 0) (= .cse2 0) (= (select .cse3 0) 0) (= (select .cse3 .cse1) .cse2) (= |ULTIMATE.start_remove_~x#1.base| .cse0) (<= (+ |ULTIMATE.start_remove_~x#1.base| 1) (+ (- 1) .cse0)) (= (select .cse4 .cse1) 0)))))) (exists ((|ULTIMATE.start_remove_~x#1.base| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|))) (let ((.cse5 (select .cse8 0))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse1))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse1) 0) (= .cse6 0) (= (select .cse7 0) 0) (= (select .cse7 .cse1) .cse6) (<= (+ |ULTIMATE.start_remove_~x#1.base| 1) (+ (- 1) .cse5)) (= (select .cse8 .cse1) 0)))))) (exists ((|ULTIMATE.start_remove_~x#1.base| Int)) (let ((.cse12 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|))) (let ((.cse9 (select .cse12 0))) (let ((.cse11 (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|)) (.cse10 (select (select |c_#memory_$Pointer$.offset| .cse9) .cse1))) (and (= (select (select |c_#memory_$Pointer$.base| .cse9) .cse1) 0) (= .cse10 0) (not (= |ULTIMATE.start_remove_~x#1.base| .cse9)) (= (select .cse11 0) 0) (= (select .cse11 .cse1) .cse10) (<= (+ |ULTIMATE.start_remove_~x#1.base| 1) (+ (- 1) .cse9)) (= (select .cse12 .cse1) 0))))))))) is different from true [2023-02-17 00:27:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 6 not checked. [2023-02-17 00:27:25,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:27:25,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136373463] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:27:25,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:27:25,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 33 [2023-02-17 00:27:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826551564] [2023-02-17 00:27:25,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:27:25,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-17 00:27:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:27:25,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-17 00:27:25,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=4, NotChecked=62, Total=1122 [2023-02-17 00:27:25,210 INFO L87 Difference]: Start difference. First operand 127 states and 157 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) [2023-02-17 00:27:27,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:29,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:31,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:33,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:35,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:37,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:43,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:45,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:48,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:50,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:56,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:27:58,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:28:00,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:28:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:28:00,852 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2023-02-17 00:28:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 00:28:00,852 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 [2023-02-17 00:28:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:28:00,853 INFO L225 Difference]: With dead ends: 199 [2023-02-17 00:28:00,853 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 00:28:00,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=383, Invalid=2583, Unknown=8, NotChecked=106, Total=3080 [2023-02-17 00:28:00,854 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 183 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 67 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2023-02-17 00:28:00,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 615 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 965 Invalid, 13 Unknown, 121 Unchecked, 27.2s Time] [2023-02-17 00:28:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 00:28:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2023-02-17 00:28:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 85 states have internal predecessors, (99), 14 states have call successors, (14), 11 states have call predecessors, (14), 13 states have return successors, (22), 14 states have call predecessors, (22), 12 states have call successors, (22) [2023-02-17 00:28:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2023-02-17 00:28:00,865 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 50 [2023-02-17 00:28:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:28:00,865 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2023-02-17 00:28:00,866 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) [2023-02-17 00:28:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2023-02-17 00:28:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-17 00:28:00,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:28:00,866 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] [2023-02-17 00:28:00,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 00:28:01,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:28:01,073 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:28:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:28:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash 191887930, now seen corresponding path program 1 times [2023-02-17 00:28:01,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:28:01,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489710030] [2023-02-17 00:28:01,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:28:01,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:28:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:28:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 00:28:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:28:01,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:28:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:28:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-17 00:28:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:28:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:28:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:28:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-17 00:28:01,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:28:01,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489710030] [2023-02-17 00:28:01,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489710030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:28:01,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78175538] [2023-02-17 00:28:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:28:01,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:28:01,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:28:01,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:28:01,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 00:28:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:28:01,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 71 conjunts are in the unsatisfiable core [2023-02-17 00:28:01,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:28:01,360 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:28:01,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:28:01,368 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:28:01,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:28:01,371 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:28:01,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:28:01,373 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:28:01,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:28:01,377 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:28:01,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:28:01,393 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-17 00:28:01,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:28:01,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:28:01,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 37 [2023-02-17 00:28:01,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2023-02-17 00:28:01,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:28:01,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:28:01,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 49 [2023-02-17 00:28:01,469 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:28:01,471 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:28:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 00:28:01,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:28:01,483 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:28:01,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:28:01,640 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 37 [2023-02-17 00:28:01,642 INFO L350 Elim1Store]: Elim1 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 276 treesize of output 258 [2023-02-17 00:28:01,647 INFO L350 Elim1Store]: Elim1 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 130 treesize of output 122 [2023-02-17 00:28:01,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 206 [2023-02-17 00:28:01,650 INFO L350 Elim1Store]: Elim1 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 206 treesize of output 190 [2023-02-17 00:28:01,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:28:01,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 50 [2023-02-17 00:28:01,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:28:01,799 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 122 [2023-02-17 00:28:01,801 INFO L350 Elim1Store]: Elim1 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 110 treesize of output 94 [2023-02-17 00:28:01,803 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 86 [2023-02-17 00:28:01,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:28:01,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 218 treesize of output 817 [2023-02-17 00:30:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-17 00:30:56,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78175538] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:30:56,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:30:56,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2023-02-17 00:30:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767381065] [2023-02-17 00:30:56,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:30:56,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 00:30:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:30:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 00:30:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=357, Unknown=6, NotChecked=0, Total=420 [2023-02-17 00:30:56,538 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-17 00:30:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:30:57,055 INFO L93 Difference]: Finished difference Result 203 states and 240 transitions. [2023-02-17 00:30:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 00:30:57,055 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 47 [2023-02-17 00:30:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:30:57,056 INFO L225 Difference]: With dead ends: 203 [2023-02-17 00:30:57,056 INFO L226 Difference]: Without dead ends: 121 [2023-02-17 00:30:57,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=308, Invalid=1018, Unknown=6, NotChecked=0, Total=1332 [2023-02-17 00:30:57,057 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 101 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 00:30:57,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 649 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 00:30:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-17 00:30:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 82. [2023-02-17 00:30:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 64 states have internal predecessors, (73), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (15), 8 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-17 00:30:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2023-02-17 00:30:57,070 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 47 [2023-02-17 00:30:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:30:57,070 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2023-02-17 00:30:57,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 19 states have internal predecessors, (65), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-17 00:30:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2023-02-17 00:30:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 00:30:57,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:30:57,072 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:30:57,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 00:30:57,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:30:57,277 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:30:57,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:30:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -664222695, now seen corresponding path program 1 times [2023-02-17 00:30:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:30:57,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048399011] [2023-02-17 00:30:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:30:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:30:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:30:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:30:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:30:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 00:30:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-17 00:30:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-17 00:30:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:30:57,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048399011] [2023-02-17 00:30:57,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048399011] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:30:57,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872872130] [2023-02-17 00:30:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:30:57,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:30:57,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:30:57,644 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:30:57,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 00:30:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:57,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-17 00:30:57,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:30:57,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:57,793 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:30:57,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:57,797 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:30:57,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:57,803 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:30:57,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:57,806 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:30:57,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:30:57,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 52 [2023-02-17 00:30:57,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:57,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-17 00:30:57,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:57,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-02-17 00:30:58,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:58,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-02-17 00:30:58,064 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 00:30:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 00:30:58,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:30:58,104 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_1148 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1148) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1147) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) is different from false [2023-02-17 00:30:58,108 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_1147 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1147) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1148 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1148) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) is different from false [2023-02-17 00:30:58,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872872130] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:30:58,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:30:58,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-17 00:30:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278770459] [2023-02-17 00:30:58,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:30:58,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 00:30:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:30:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 00:30:58,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=257, Unknown=2, NotChecked=66, Total=380 [2023-02-17 00:30:58,114 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-17 00:30:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:30:58,422 INFO L93 Difference]: Finished difference Result 136 states and 157 transitions. [2023-02-17 00:30:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 00:30:58,423 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 53 [2023-02-17 00:30:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:30:58,423 INFO L225 Difference]: With dead ends: 136 [2023-02-17 00:30:58,423 INFO L226 Difference]: Without dead ends: 116 [2023-02-17 00:30:58,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=567, Unknown=2, NotChecked=106, Total=870 [2023-02-17 00:30:58,424 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 210 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 00:30:58,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 277 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 00:30:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-17 00:30:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2023-02-17 00:30:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.144578313253012) internal successors, (95), 85 states have internal predecessors, (95), 13 states have call successors, (13), 11 states have call predecessors, (13), 11 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2023-02-17 00:30:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2023-02-17 00:30:58,437 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 53 [2023-02-17 00:30:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:30:58,438 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2023-02-17 00:30:58,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-17 00:30:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2023-02-17 00:30:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 00:30:58,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:30:58,438 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:30:58,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 00:30:58,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-17 00:30:58,644 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:30:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:30:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1675339945, now seen corresponding path program 1 times [2023-02-17 00:30:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:30:58,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20883062] [2023-02-17 00:30:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:30:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:30:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:30:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:59,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:30:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:30:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 00:30:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-17 00:30:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 00:30:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:30:59,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20883062] [2023-02-17 00:30:59,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20883062] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:30:59,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177980238] [2023-02-17 00:30:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:30:59,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:30:59,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:30:59,055 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:30:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 00:30:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:30:59,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-17 00:30:59,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:30:59,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 00:30:59,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-17 00:30:59,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 00:30:59,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-17 00:30:59,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:30:59,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 65 [2023-02-17 00:30:59,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-02-17 00:30:59,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2023-02-17 00:30:59,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:30:59,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 156 [2023-02-17 00:30:59,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 109 [2023-02-17 00:30:59,767 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:30:59,770 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:30:59,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2023-02-17 00:30:59,791 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:30:59,792 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 00:30:59,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:30:59,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:30:59,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 75 treesize of output 56 [2023-02-17 00:31:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 00:31:00,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:31:00,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177980238] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:31:00,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:31:00,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2023-02-17 00:31:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177380783] [2023-02-17 00:31:00,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:31:00,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-17 00:31:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:31:00,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-17 00:31:00,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1474, Unknown=0, NotChecked=0, Total=1640 [2023-02-17 00:31:00,733 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-17 00:31:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:31:02,337 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2023-02-17 00:31:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-17 00:31:02,338 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 53 [2023-02-17 00:31:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:31:02,338 INFO L225 Difference]: With dead ends: 137 [2023-02-17 00:31:02,338 INFO L226 Difference]: Without dead ends: 132 [2023-02-17 00:31:02,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=549, Invalid=3357, Unknown=0, NotChecked=0, Total=3906 [2023-02-17 00:31:02,340 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 218 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 00:31:02,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 325 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 00:31:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-17 00:31:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2023-02-17 00:31:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 95 states have internal predecessors, (106), 15 states have call successors, (15), 13 states have call predecessors, (15), 13 states have return successors, (21), 12 states have call predecessors, (21), 14 states have call successors, (21) [2023-02-17 00:31:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2023-02-17 00:31:02,360 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 53 [2023-02-17 00:31:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:31:02,360 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2023-02-17 00:31:02,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-17 00:31:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2023-02-17 00:31:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 00:31:02,361 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:31:02,361 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:31:02,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 00:31:02,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-17 00:31:02,568 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:31:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:31:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1417174507, now seen corresponding path program 1 times [2023-02-17 00:31:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:31:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842487480] [2023-02-17 00:31:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:31:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:31:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:31:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-17 00:31:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:31:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 00:31:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:31:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-17 00:31:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:31:02,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 00:31:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:31:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-17 00:31:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:31:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-17 00:31:02,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:31:02,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842487480] [2023-02-17 00:31:02,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842487480] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:31:02,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871369007] [2023-02-17 00:31:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:31:02,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:31:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:31:02,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:31:02,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 00:31:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:31:02,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-17 00:31:02,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:31:02,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:31:02,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 00:31:02,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:31:02,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 00:31:02,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:31:02,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-17 00:31:02,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:31:02,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-17 00:31:03,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:31:03,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:31:03,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:31:03,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 67 [2023-02-17 00:31:03,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:31:03,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2023-02-17 00:31:03,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:31:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:31:03,269 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:31:03,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:31:03,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 39 [2023-02-17 00:31:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 00:31:03,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:31:03,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871369007] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:31:03,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:31:03,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2023-02-17 00:31:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362404965] [2023-02-17 00:31:03,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:31:03,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 00:31:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:31:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 00:31:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2023-02-17 00:31:03,346 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10)