/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/array-fpi/s12if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 19:59:35,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 19:59:35,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 19:59:35,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 19:59:35,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 19:59:35,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 19:59:35,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 19:59:35,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 19:59:35,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 19:59:35,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 19:59:35,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 19:59:35,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 19:59:35,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 19:59:35,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 19:59:35,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 19:59:35,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 19:59:35,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 19:59:35,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 19:59:35,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 19:59:35,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 19:59:35,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 19:59:35,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 19:59:35,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 19:59:35,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 19:59:35,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 19:59:35,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 19:59:35,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 19:59:35,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 19:59:35,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 19:59:35,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 19:59:35,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 19:59:35,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 19:59:35,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 19:59:35,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 19:59:35,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 19:59:35,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 19:59:35,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 19:59:35,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 19:59:35,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 19:59:35,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 19:59:35,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 19:59:35,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-01 19:59:35,117 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 19:59:35,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 19:59:35,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 19:59:35,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 19:59:35,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 19:59:35,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 19:59:35,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 19:59:35,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 19:59:35,120 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 19:59:35,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 19:59:35,121 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 19:59:35,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 19:59:35,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 19:59:35,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 19:59:35,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 19:59:35,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 19:59:35,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 19:59:35,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 19:59:35,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 19:59:35,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 19:59:35,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 19:59:35,123 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 19:59:35,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 19:59:35,123 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 19:59:35,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 19:59:35,123 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 19:59:35,123 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 [2023-04-01 19:59:35,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 19:59:35,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 19:59:35,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 19:59:35,329 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 19:59:35,329 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 19:59:35,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s12if.c [2023-04-01 19:59:36,268 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 19:59:36,444 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 19:59:36,444 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c [2023-04-01 19:59:36,448 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc085ff67/93f6a3a96cd1407aa4daa5cffbb5251d/FLAG3d22dfbf6 [2023-04-01 19:59:36,857 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc085ff67/93f6a3a96cd1407aa4daa5cffbb5251d [2023-04-01 19:59:36,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 19:59:36,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 19:59:36,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 19:59:36,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 19:59:36,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 19:59:36,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 07:59:36" (1/1) ... [2023-04-01 19:59:36,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d03e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:36, skipping insertion in model container [2023-04-01 19:59:36,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 07:59:36" (1/1) ... [2023-04-01 19:59:36,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 19:59:36,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 19:59:36,996 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c[588,601] [2023-04-01 19:59:37,013 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 19:59:37,021 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 19:59:37,029 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c[588,601] [2023-04-01 19:59:37,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 19:59:37,044 INFO L208 MainTranslator]: Completed translation [2023-04-01 19:59:37,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37 WrapperNode [2023-04-01 19:59:37,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 19:59:37,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 19:59:37,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 19:59:37,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 19:59:37,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,075 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 19:59:37,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 19:59:37,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 19:59:37,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 19:59:37,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (1/1) ... [2023-04-01 19:59:37,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 19:59:37,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:37,104 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-04-01 19:59:37,109 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-04-01 19:59:37,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 19:59:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 19:59:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 19:59:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 19:59:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 19:59:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 19:59:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 19:59:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 19:59:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 19:59:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 19:59:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 19:59:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 19:59:37,191 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 19:59:37,193 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 19:59:37,366 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 19:59:37,371 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 19:59:37,371 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-01 19:59:37,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 07:59:37 BoogieIcfgContainer [2023-04-01 19:59:37,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 19:59:37,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 19:59:37,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 19:59:37,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 19:59:37,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 07:59:36" (1/3) ... [2023-04-01 19:59:37,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc66fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 07:59:37, skipping insertion in model container [2023-04-01 19:59:37,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:59:37" (2/3) ... [2023-04-01 19:59:37,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc66fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 07:59:37, skipping insertion in model container [2023-04-01 19:59:37,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 07:59:37" (3/3) ... [2023-04-01 19:59:37,388 INFO L112 eAbstractionObserver]: Analyzing ICFG s12if.c [2023-04-01 19:59:37,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 19:59:37,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 19:59:37,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 19:59:37,454 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;@76bf9256, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 19:59:37,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 19:59:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 19:59:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 19:59:37,465 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:37,466 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, 1, 1, 1] [2023-04-01 19:59:37,466 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:37,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1742232210, now seen corresponding path program 1 times [2023-04-01 19:59:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:37,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947000548] [2023-04-01 19:59:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:59:37,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947000548] [2023-04-01 19:59:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947000548] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 19:59:37,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 19:59:37,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 19:59:37,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902311990] [2023-04-01 19:59:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 19:59:37,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 19:59:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:37,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 19:59:37,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 19:59:37,673 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:37,772 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2023-04-01 19:59:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 19:59:37,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-04-01 19:59:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:37,778 INFO L225 Difference]: With dead ends: 62 [2023-04-01 19:59:37,778 INFO L226 Difference]: Without dead ends: 29 [2023-04-01 19:59:37,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 19:59:37,782 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:37,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:37,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-01 19:59:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-04-01 19:59:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-04-01 19:59:37,808 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2023-04-01 19:59:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:37,808 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-04-01 19:59:37,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-04-01 19:59:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 19:59:37,809 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:37,809 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, 1, 1, 1] [2023-04-01 19:59:37,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 19:59:37,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:37,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:37,810 INFO L85 PathProgramCache]: Analyzing trace with hash 416194299, now seen corresponding path program 1 times [2023-04-01 19:59:37,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:37,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696477338] [2023-04-01 19:59:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:37,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:37,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:37,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:59:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:37,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696477338] [2023-04-01 19:59:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696477338] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 19:59:37,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 19:59:37,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 19:59:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360124837] [2023-04-01 19:59:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 19:59:37,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 19:59:37,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:37,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 19:59:37,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-01 19:59:37,927 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:38,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:38,025 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2023-04-01 19:59:38,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 19:59:38,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-04-01 19:59:38,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:38,026 INFO L225 Difference]: With dead ends: 51 [2023-04-01 19:59:38,027 INFO L226 Difference]: Without dead ends: 37 [2023-04-01 19:59:38,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-04-01 19:59:38,038 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:38,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 22 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-01 19:59:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2023-04-01 19:59:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-04-01 19:59:38,050 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2023-04-01 19:59:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:38,050 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-04-01 19:59:38,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-04-01 19:59:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 19:59:38,051 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:38,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:38,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 19:59:38,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:38,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash -708797194, now seen corresponding path program 1 times [2023-04-01 19:59:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894597920] [2023-04-01 19:59:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:38,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:38,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894597920] [2023-04-01 19:59:38,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894597920] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527219349] [2023-04-01 19:59:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:38,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:38,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:38,727 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-04-01 19:59:38,748 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-04-01 19:59:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:38,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjunts are in the unsatisfiable core [2023-04-01 19:59:38,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:38,943 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 19:59:38,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:38,991 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-04-01 19:59:39,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:39,087 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-04-01 19:59:39,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:39,152 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-04-01 19:59:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:39,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:39,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 19:59:39,585 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 1 case distinctions, treesize of input 22 treesize of output 23 [2023-04-01 19:59:39,589 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 19:59:39,592 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 20 treesize of output 12 [2023-04-01 19:59:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:59:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527219349] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:39,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:39,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 33 [2023-04-01 19:59:39,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110567651] [2023-04-01 19:59:39,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:39,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-01 19:59:39,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:39,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-01 19:59:39,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=878, Unknown=5, NotChecked=0, Total=1056 [2023-04-01 19:59:39,713 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 19:59:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:40,412 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-04-01 19:59:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-01 19:59:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-04-01 19:59:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:40,414 INFO L225 Difference]: With dead ends: 58 [2023-04-01 19:59:40,414 INFO L226 Difference]: Without dead ends: 52 [2023-04-01 19:59:40,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=1866, Unknown=5, NotChecked=0, Total=2256 [2023-04-01 19:59:40,415 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 39 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:40,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 77 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 491 Invalid, 4 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 19:59:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-01 19:59:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2023-04-01 19:59:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-04-01 19:59:40,423 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2023-04-01 19:59:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:40,423 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-04-01 19:59:40,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 19:59:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-04-01 19:59:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 19:59:40,424 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:40,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:40,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:40,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:40,625 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:40,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1518143820, now seen corresponding path program 1 times [2023-04-01 19:59:40,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:40,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043835408] [2023-04-01 19:59:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:40,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:40,637 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 19:59:40,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869858532] [2023-04-01 19:59:40,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:40,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:40,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:40,638 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-04-01 19:59:40,640 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-04-01 19:59:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:40,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjunts are in the unsatisfiable core [2023-04-01 19:59:40,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:40,723 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-04-01 19:59:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:40,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:40,780 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 27 treesize of output 23 [2023-04-01 19:59:40,783 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 19:59:40,784 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 24 treesize of output 16 [2023-04-01 19:59:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:40,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:40,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043835408] [2023-04-01 19:59:40,794 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 19:59:40,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869858532] [2023-04-01 19:59:40,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869858532] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:40,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 19:59:40,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-04-01 19:59:40,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874607419] [2023-04-01 19:59:40,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:40,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 19:59:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:40,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 19:59:40,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-04-01 19:59:40,796 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:40,919 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2023-04-01 19:59:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 19:59:40,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-04-01 19:59:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:40,925 INFO L225 Difference]: With dead ends: 89 [2023-04-01 19:59:40,925 INFO L226 Difference]: Without dead ends: 75 [2023-04-01 19:59:40,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-04-01 19:59:40,927 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:40,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-04-01 19:59:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2023-04-01 19:59:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-04-01 19:59:40,941 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 31 [2023-04-01 19:59:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:40,941 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-04-01 19:59:40,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-04-01 19:59:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 19:59:40,942 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:40,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:40,950 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-04-01 19:59:41,142 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,SelfDestructingSolverStorable3 [2023-04-01 19:59:41,143 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:41,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2104949834, now seen corresponding path program 1 times [2023-04-01 19:59:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886197641] [2023-04-01 19:59:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:41,151 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 19:59:41,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828796163] [2023-04-01 19:59:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:41,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:41,157 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-04-01 19:59:41,159 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-04-01 19:59:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:41,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-01 19:59:41,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:41,232 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 19:59:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:41,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:41,275 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 14 treesize of output 12 [2023-04-01 19:59:41,281 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 14 treesize of output 12 [2023-04-01 19:59:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:41,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886197641] [2023-04-01 19:59:41,293 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 19:59:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828796163] [2023-04-01 19:59:41,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828796163] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:41,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 19:59:41,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-04-01 19:59:41,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680701517] [2023-04-01 19:59:41,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:41,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 19:59:41,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 19:59:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-01 19:59:41,296 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:41,364 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-04-01 19:59:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 19:59:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-04-01 19:59:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:41,366 INFO L225 Difference]: With dead ends: 90 [2023-04-01 19:59:41,366 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 19:59:41,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-04-01 19:59:41,367 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:41,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 134 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 19:59:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 19:59:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2023-04-01 19:59:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2023-04-01 19:59:41,385 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 31 [2023-04-01 19:59:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:41,385 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2023-04-01 19:59:41,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2023-04-01 19:59:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-01 19:59:41,388 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:41,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:41,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 19:59:41,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:41,593 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:41,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1233490552, now seen corresponding path program 2 times [2023-04-01 19:59:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148281566] [2023-04-01 19:59:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:41,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148281566] [2023-04-01 19:59:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148281566] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054707163] [2023-04-01 19:59:41,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 19:59:41,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:41,733 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-04-01 19:59:41,736 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-04-01 19:59:41,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 19:59:41,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:41,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 19:59:41,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:41,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054707163] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:41,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-04-01 19:59:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785118220] [2023-04-01 19:59:41,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:41,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 19:59:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 19:59:41,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-04-01 19:59:41,894 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:42,094 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2023-04-01 19:59:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 19:59:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-04-01 19:59:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:42,096 INFO L225 Difference]: With dead ends: 97 [2023-04-01 19:59:42,097 INFO L226 Difference]: Without dead ends: 85 [2023-04-01 19:59:42,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-04-01 19:59:42,098 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:42,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 62 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-04-01 19:59:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2023-04-01 19:59:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2023-04-01 19:59:42,114 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 33 [2023-04-01 19:59:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:42,114 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2023-04-01 19:59:42,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2023-04-01 19:59:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-04-01 19:59:42,119 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:42,119 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] [2023-04-01 19:59:42,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:42,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:42,323 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:42,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:42,323 INFO L85 PathProgramCache]: Analyzing trace with hash -41402357, now seen corresponding path program 3 times [2023-04-01 19:59:42,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:42,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272523122] [2023-04-01 19:59:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:42,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:42,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:42,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:42,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272523122] [2023-04-01 19:59:42,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272523122] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:42,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368228562] [2023-04-01 19:59:42,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 19:59:42,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:42,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:42,384 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-04-01 19:59:42,386 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-04-01 19:59:42,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 19:59:42,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:42,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 19:59:42,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:42,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 19:59:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368228562] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:42,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-04-01 19:59:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031281291] [2023-04-01 19:59:42,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:42,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 19:59:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 19:59:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-04-01 19:59:42,500 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:42,613 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2023-04-01 19:59:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 19:59:42,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-04-01 19:59:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:42,614 INFO L225 Difference]: With dead ends: 90 [2023-04-01 19:59:42,614 INFO L226 Difference]: Without dead ends: 52 [2023-04-01 19:59:42,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-04-01 19:59:42,615 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:42,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:42,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-01 19:59:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2023-04-01 19:59:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-04-01 19:59:42,620 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2023-04-01 19:59:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:42,621 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-04-01 19:59:42,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-04-01 19:59:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 19:59:42,621 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:42,621 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-04-01 19:59:42,636 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-04-01 19:59:42,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:42,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:42,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:42,826 INFO L85 PathProgramCache]: Analyzing trace with hash 854203999, now seen corresponding path program 4 times [2023-04-01 19:59:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780174157] [2023-04-01 19:59:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 19:59:43,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:43,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780174157] [2023-04-01 19:59:43,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780174157] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:43,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303447071] [2023-04-01 19:59:43,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 19:59:43,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:43,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:43,341 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-04-01 19:59:43,364 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-04-01 19:59:43,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 19:59:43,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:43,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2023-04-01 19:59:43,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:43,424 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 19:59:43,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:43,444 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-04-01 19:59:43,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:43,472 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-04-01 19:59:43,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:43,557 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-04-01 19:59:43,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:43,577 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-04-01 19:59:43,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:43,633 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-04-01 19:59:43,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:43,720 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 19:59:43,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 19:59:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 19:59:43,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:44,085 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array Int Int)) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_61 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* main_~i~0 4))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (= (* c_~N~0 2) (+ .cse2 4))))))) is different from false [2023-04-01 19:59:44,266 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~i~0 2))) (and (forall ((v_ArrVal_206 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (< (+ .cse2 1) .cse3)))))) (forall ((v_ArrVal_206 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (< .cse3 (+ 3 .cse6))))))))) is different from false [2023-04-01 19:59:44,304 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~i~0 2))) (and (forall ((v_ArrVal_206 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse3 |c_main_~#sum~0.offset|))) (or (< .cse0 (+ .cse1 1)) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* v_main_~i~0_67 4)))))))))) (forall ((v_ArrVal_206 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (< .cse6 (+ .cse0 1))))))))) is different from false [2023-04-01 19:59:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2023-04-01 19:59:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303447071] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:44,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:44,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 40 [2023-04-01 19:59:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991025590] [2023-04-01 19:59:44,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:44,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-04-01 19:59:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:44,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-04-01 19:59:44,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1195, Unknown=3, NotChecked=216, Total=1560 [2023-04-01 19:59:44,359 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:45,928 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2023-04-01 19:59:45,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-04-01 19:59:45,928 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-04-01 19:59:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:45,929 INFO L225 Difference]: With dead ends: 103 [2023-04-01 19:59:45,929 INFO L226 Difference]: Without dead ends: 97 [2023-04-01 19:59:45,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=443, Invalid=3106, Unknown=3, NotChecked=354, Total=3906 [2023-04-01 19:59:45,931 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 67 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:45,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 174 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1022 Invalid, 11 Unknown, 246 Unchecked, 0.6s Time] [2023-04-01 19:59:45,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-04-01 19:59:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2023-04-01 19:59:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2023-04-01 19:59:45,945 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 39 [2023-04-01 19:59:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:45,946 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2023-04-01 19:59:45,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2023-04-01 19:59:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 19:59:45,946 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:45,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:45,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-04-01 19:59:46,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:46,153 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:46,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash 44857373, now seen corresponding path program 1 times [2023-04-01 19:59:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:46,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252647874] [2023-04-01 19:59:46,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:46,164 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 19:59:46,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723166097] [2023-04-01 19:59:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:46,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:46,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:46,165 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-04-01 19:59:46,167 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-04-01 19:59:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:46,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-01 19:59:46,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:46,229 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 10 treesize of output 8 [2023-04-01 19:59:46,278 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 19 treesize of output 11 [2023-04-01 19:59:46,321 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-04-01 19:59:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 19:59:46,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:46,375 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_252) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2023-04-01 19:59:46,380 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_252) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2023-04-01 19:59:46,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 19:59:46,408 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 2 case distinctions, treesize of input 37 treesize of output 29 [2023-04-01 19:59:46,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 19:59:46,414 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 38 treesize of output 32 [2023-04-01 19:59:46,417 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-04-01 19:59:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2023-04-01 19:59:46,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252647874] [2023-04-01 19:59:46,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 19:59:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723166097] [2023-04-01 19:59:46,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723166097] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:46,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 19:59:46,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-04-01 19:59:46,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745195584] [2023-04-01 19:59:46,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:46,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 19:59:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 19:59:46,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2023-04-01 19:59:46,472 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:46,738 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2023-04-01 19:59:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 19:59:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-04-01 19:59:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:46,739 INFO L225 Difference]: With dead ends: 124 [2023-04-01 19:59:46,739 INFO L226 Difference]: Without dead ends: 115 [2023-04-01 19:59:46,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=363, Unknown=2, NotChecked=82, Total=552 [2023-04-01 19:59:46,740 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 103 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:46,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 171 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2023-04-01 19:59:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-04-01 19:59:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2023-04-01 19:59:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-04-01 19:59:46,750 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 39 [2023-04-01 19:59:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:46,750 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-04-01 19:59:46,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-04-01 19:59:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 19:59:46,750 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:46,750 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-04-01 19:59:46,759 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-04-01 19:59:46,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:46,957 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:46,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash -976210981, now seen corresponding path program 1 times [2023-04-01 19:59:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:46,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554480371] [2023-04-01 19:59:46,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:46,966 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 19:59:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823167348] [2023-04-01 19:59:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:46,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:46,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:46,968 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-04-01 19:59:46,970 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-04-01 19:59:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:47,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjunts are in the unsatisfiable core [2023-04-01 19:59:47,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:47,042 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 19:59:47,075 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 19 treesize of output 18 [2023-04-01 19:59:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 19:59:47,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:47,126 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 16 treesize of output 14 [2023-04-01 19:59:47,128 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 16 treesize of output 12 [2023-04-01 19:59:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 19:59:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554480371] [2023-04-01 19:59:47,148 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 19:59:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823167348] [2023-04-01 19:59:47,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823167348] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:47,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 19:59:47,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-04-01 19:59:47,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591249391] [2023-04-01 19:59:47,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:47,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 19:59:47,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:47,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 19:59:47,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-04-01 19:59:47,149 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:47,252 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2023-04-01 19:59:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 19:59:47,252 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-04-01 19:59:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:47,253 INFO L225 Difference]: With dead ends: 127 [2023-04-01 19:59:47,253 INFO L226 Difference]: Without dead ends: 94 [2023-04-01 19:59:47,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-04-01 19:59:47,254 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:47,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 146 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-04-01 19:59:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2023-04-01 19:59:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.236842105263158) internal successors, (94), 76 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2023-04-01 19:59:47,263 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 39 [2023-04-01 19:59:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:47,263 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2023-04-01 19:59:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2023-04-01 19:59:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-01 19:59:47,264 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:47,264 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-04-01 19:59:47,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-04-01 19:59:47,468 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,SelfDestructingSolverStorable9 [2023-04-01 19:59:47,469 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:47,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1806332385, now seen corresponding path program 5 times [2023-04-01 19:59:47,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:47,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107547193] [2023-04-01 19:59:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:47,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 19:59:47,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107547193] [2023-04-01 19:59:47,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107547193] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:47,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721723020] [2023-04-01 19:59:47,555 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 19:59:47,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:47,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:47,556 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-04-01 19:59:47,559 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-04-01 19:59:47,626 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-04-01 19:59:47,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:47,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 19:59:47,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 19:59:47,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 19:59:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721723020] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:47,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:47,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-04-01 19:59:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474033261] [2023-04-01 19:59:47,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:47,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 19:59:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 19:59:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-04-01 19:59:47,740 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:47,981 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2023-04-01 19:59:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 19:59:47,981 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2023-04-01 19:59:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:47,982 INFO L225 Difference]: With dead ends: 133 [2023-04-01 19:59:47,982 INFO L226 Difference]: Without dead ends: 118 [2023-04-01 19:59:47,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-04-01 19:59:47,982 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 66 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:47,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 59 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 19:59:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-04-01 19:59:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2023-04-01 19:59:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2023-04-01 19:59:47,992 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 41 [2023-04-01 19:59:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:47,992 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2023-04-01 19:59:47,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2023-04-01 19:59:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-04-01 19:59:47,993 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:47,993 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-04-01 19:59:48,000 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-04-01 19:59:48,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:48,198 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:48,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1586682370, now seen corresponding path program 6 times [2023-04-01 19:59:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215405528] [2023-04-01 19:59:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:48,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 19:59:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215405528] [2023-04-01 19:59:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215405528] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76456877] [2023-04-01 19:59:48,305 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-01 19:59:48,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:48,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:48,306 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-04-01 19:59:48,308 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-04-01 19:59:48,358 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-04-01 19:59:48,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:48,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 19:59:48,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 19:59:48,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 19:59:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76456877] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:48,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:48,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-04-01 19:59:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429724611] [2023-04-01 19:59:48,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:48,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 19:59:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 19:59:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-04-01 19:59:48,447 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:48,589 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2023-04-01 19:59:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 19:59:48,590 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2023-04-01 19:59:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:48,590 INFO L225 Difference]: With dead ends: 121 [2023-04-01 19:59:48,590 INFO L226 Difference]: Without dead ends: 63 [2023-04-01 19:59:48,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-04-01 19:59:48,593 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:48,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 45 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-01 19:59:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2023-04-01 19:59:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-04-01 19:59:48,600 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 42 [2023-04-01 19:59:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:48,600 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-04-01 19:59:48,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-04-01 19:59:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 19:59:48,601 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:48,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:48,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:48,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 19:59:48,807 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:48,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1783122278, now seen corresponding path program 7 times [2023-04-01 19:59:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456672172] [2023-04-01 19:59:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:49,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:49,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:49,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456672172] [2023-04-01 19:59:49,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456672172] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:49,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646766981] [2023-04-01 19:59:49,508 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 19:59:49,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:49,509 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 19:59:49,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 19:59:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:49,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjunts are in the unsatisfiable core [2023-04-01 19:59:49,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:49,632 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 19:59:49,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:49,668 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-04-01 19:59:49,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:49,710 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-04-01 19:59:49,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:49,750 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-04-01 19:59:49,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:49,862 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-04-01 19:59:49,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:49,886 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-04-01 19:59:49,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:49,906 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-04-01 19:59:49,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:49,987 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-04-01 19:59:50,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:50,085 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 19:59:50,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 19:59:50,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:59:50,190 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 19:59:50,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 19:59:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:50,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:50,748 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_main_~i~0_124 Int) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_126 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_436))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_126))) 2)) (= (+ 6 .cse2) (* c_~N~0 2)) (not (= 2 (select v_ArrVal_436 (+ main_~a~0.offset (* main_~i~0 4))))) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_124)))))))))) is different from false [2023-04-01 19:59:51,337 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 19:59:51,338 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 1 case distinctions, treesize of input 141 treesize of output 1 [2023-04-01 19:59:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2023-04-01 19:59:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646766981] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:51,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:51,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 18] total 51 [2023-04-01 19:59:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443147604] [2023-04-01 19:59:51,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:51,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-04-01 19:59:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:51,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-04-01 19:59:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2230, Unknown=1, NotChecked=96, Total=2550 [2023-04-01 19:59:51,356 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 51 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 47 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 19:59:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:55,404 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2023-04-01 19:59:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-04-01 19:59:55,405 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 47 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2023-04-01 19:59:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:55,405 INFO L225 Difference]: With dead ends: 136 [2023-04-01 19:59:55,405 INFO L226 Difference]: Without dead ends: 130 [2023-04-01 19:59:55,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=833, Invalid=7359, Unknown=2, NotChecked=178, Total=8372 [2023-04-01 19:59:55,407 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 111 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 173 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:55,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 142 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1792 Invalid, 30 Unknown, 102 Unchecked, 1.5s Time] [2023-04-01 19:59:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-04-01 19:59:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2023-04-01 19:59:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2023-04-01 19:59:55,423 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 47 [2023-04-01 19:59:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:55,423 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2023-04-01 19:59:55,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 47 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 19:59:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2023-04-01 19:59:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 19:59:55,424 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:55,424 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2023-04-01 19:59:55,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-04-01 19:59:55,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 19:59:55,628 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:55,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1702498392, now seen corresponding path program 2 times [2023-04-01 19:59:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259617529] [2023-04-01 19:59:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:55,641 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 19:59:55,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38870299] [2023-04-01 19:59:55,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 19:59:55,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:55,643 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 19:59:55,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 19:59:55,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 19:59:55,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:55,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjunts are in the unsatisfiable core [2023-04-01 19:59:55,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:55,722 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 10 treesize of output 8 [2023-04-01 19:59:55,810 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 19 treesize of output 11 [2023-04-01 19:59:55,846 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-04-01 19:59:55,873 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-04-01 19:59:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 19:59:55,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:56,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 19:59:56,001 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 2 case distinctions, treesize of input 37 treesize of output 29 [2023-04-01 19:59:56,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 19:59:56,006 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 38 treesize of output 32 [2023-04-01 19:59:56,012 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-04-01 19:59:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 19:59:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259617529] [2023-04-01 19:59:56,082 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 19:59:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38870299] [2023-04-01 19:59:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38870299] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:56,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 19:59:56,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-04-01 19:59:56,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891218529] [2023-04-01 19:59:56,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:56,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 19:59:56,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:56,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 19:59:56,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=409, Unknown=9, NotChecked=0, Total=506 [2023-04-01 19:59:56,084 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:56,435 INFO L93 Difference]: Finished difference Result 154 states and 191 transitions. [2023-04-01 19:59:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 19:59:56,435 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2023-04-01 19:59:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:56,436 INFO L225 Difference]: With dead ends: 154 [2023-04-01 19:59:56,436 INFO L226 Difference]: Without dead ends: 145 [2023-04-01 19:59:56,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=610, Unknown=9, NotChecked=0, Total=756 [2023-04-01 19:59:56,436 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:56,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 224 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 19:59:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-04-01 19:59:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2023-04-01 19:59:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2023-04-01 19:59:56,453 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 47 [2023-04-01 19:59:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:56,453 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2023-04-01 19:59:56,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2023-04-01 19:59:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 19:59:56,453 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:56,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-04-01 19:59:56,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:56,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 19:59:56,654 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:56,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash 13554650, now seen corresponding path program 2 times [2023-04-01 19:59:56,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:56,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940931821] [2023-04-01 19:59:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:56,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:56,665 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 19:59:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017360611] [2023-04-01 19:59:56,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 19:59:56,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:56,666 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 19:59:56,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 19:59:56,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 19:59:56,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:56,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-01 19:59:56,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:56,758 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 19:59:56,783 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 19 treesize of output 18 [2023-04-01 19:59:56,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 19 treesize of output 18 [2023-04-01 19:59:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:56,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:56,881 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 16 treesize of output 14 [2023-04-01 19:59:56,883 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 16 treesize of output 12 [2023-04-01 19:59:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940931821] [2023-04-01 19:59:56,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 19:59:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017360611] [2023-04-01 19:59:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017360611] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:56,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 19:59:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-04-01 19:59:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654969319] [2023-04-01 19:59:56,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:56,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 19:59:56,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:56,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 19:59:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-04-01 19:59:56,913 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:57,082 INFO L93 Difference]: Finished difference Result 171 states and 215 transitions. [2023-04-01 19:59:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 19:59:57,082 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2023-04-01 19:59:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:57,083 INFO L225 Difference]: With dead ends: 171 [2023-04-01 19:59:57,083 INFO L226 Difference]: Without dead ends: 124 [2023-04-01 19:59:57,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-04-01 19:59:57,084 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:57,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 178 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-04-01 19:59:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2023-04-01 19:59:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2023-04-01 19:59:57,105 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 47 [2023-04-01 19:59:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:57,105 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2023-04-01 19:59:57,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2023-04-01 19:59:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-04-01 19:59:57,106 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:57,106 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:57,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:57,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-01 19:59:57,311 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:57,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1992988644, now seen corresponding path program 8 times [2023-04-01 19:59:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51347138] [2023-04-01 19:59:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51347138] [2023-04-01 19:59:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51347138] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362997177] [2023-04-01 19:59:57,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 19:59:57,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:57,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:57,430 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 19:59:57,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-01 19:59:57,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 19:59:57,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:57,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 19:59:57,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:57,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:57,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362997177] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:57,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:57,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-04-01 19:59:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234030818] [2023-04-01 19:59:57,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:57,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 19:59:57,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:57,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 19:59:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-04-01 19:59:57,674 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:57,980 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2023-04-01 19:59:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 19:59:57,980 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2023-04-01 19:59:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:57,981 INFO L225 Difference]: With dead ends: 172 [2023-04-01 19:59:57,981 INFO L226 Difference]: Without dead ends: 154 [2023-04-01 19:59:57,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2023-04-01 19:59:57,982 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:57,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 75 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 19:59:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-04-01 19:59:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 110. [2023-04-01 19:59:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2023-04-01 19:59:57,998 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 49 [2023-04-01 19:59:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:57,998 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2023-04-01 19:59:57,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2023-04-01 19:59:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-04-01 19:59:57,998 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:57,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:58,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:58,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:58,203 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:58,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash 836309991, now seen corresponding path program 9 times [2023-04-01 19:59:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480735389] [2023-04-01 19:59:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:58,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:58,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480735389] [2023-04-01 19:59:58,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480735389] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:58,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029241431] [2023-04-01 19:59:58,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 19:59:58,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:58,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:58,303 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 19:59:58,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-01 19:59:58,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 19:59:58,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:58,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 19:59:58,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:58,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 19:59:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029241431] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:58,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:58,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-04-01 19:59:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628325242] [2023-04-01 19:59:58,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:58,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 19:59:58,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 19:59:58,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-04-01 19:59:58,548 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:58,743 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2023-04-01 19:59:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 19:59:58,743 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2023-04-01 19:59:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:58,743 INFO L225 Difference]: With dead ends: 155 [2023-04-01 19:59:58,743 INFO L226 Difference]: Without dead ends: 74 [2023-04-01 19:59:58,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-04-01 19:59:58,744 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 70 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:58,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 45 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:59:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-04-01 19:59:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2023-04-01 19:59:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-04-01 19:59:58,754 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 50 [2023-04-01 19:59:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:58,754 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-04-01 19:59:58,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-04-01 19:59:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 19:59:58,755 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:58,755 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:58,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:58,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-04-01 19:59:58,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:58,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash -217929789, now seen corresponding path program 10 times [2023-04-01 19:59:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:58,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336568095] [2023-04-01 19:59:58,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:58,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 19:59:59,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:59,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336568095] [2023-04-01 19:59:59,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336568095] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:59,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837580812] [2023-04-01 19:59:59,862 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 19:59:59,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:59,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:59,873 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 19:59:59,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-04-01 19:59:59,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 19:59:59,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:59,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 67 conjunts are in the unsatisfiable core [2023-04-01 19:59:59,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:59,970 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 19:59:59,973 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 10 treesize of output 8 [2023-04-01 19:59:59,997 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-04-01 20:00:00,026 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-04-01 20:00:00,059 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-04-01 20:00:00,107 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-04-01 20:00:00,156 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-04-01 20:00:00,181 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-04-01 20:00:00,202 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-04-01 20:00:00,217 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-04-01 20:00:00,292 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-04-01 20:00:00,430 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:00,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:00:00,602 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-04-01 20:00:00,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 53 [2023-04-01 20:00:00,816 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-04-01 20:00:00,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 67 [2023-04-01 20:00:01,066 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-04-01 20:00:01,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 16 [2023-04-01 20:00:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:00:01,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:03,552 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (< (+ v_main_~i~0_215 1) c_~N~0) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (= (* c_~N~0 2) (+ .cse2 8))))))) is different from false [2023-04-01 20:00:05,977 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~i~0 1))) (and (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< (* 2 v_main_~i~0_215) (+ 7 .cse2)) (< v_main_~i~0_215 .cse3)))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 6 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ 3 .cse6) (* c_main_~i~0 2)) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse3)))))))) is different from false [2023-04-01 20:00:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 22 refuted. 2 times theorem prover too weak. 15 trivial. 19 not checked. [2023-04-01 20:00:08,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837580812] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:08,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:08,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 25] total 67 [2023-04-01 20:00:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480953209] [2023-04-01 20:00:08,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:08,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-04-01 20:00:08,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-04-01 20:00:08,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3817, Unknown=38, NotChecked=254, Total=4422 [2023-04-01 20:00:08,754 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 67 states, 65 states have (on average 1.646153846153846) internal successors, (107), 64 states have internal predecessors, (107), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:15,940 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse20 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (.cse8 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse10 (+ c_main_~i~0 1)) (.cse7 (select .cse8 |c_main_~#sum~0.offset|)) (.cse1 (= 2 .cse0))) (let ((.cse11 (not .cse1)) (.cse12 (<= .cse7 2)) (.cse5 (+ c_main_~i~0 3)) (.cse14 (not (= 2 |c_main_#t~mem12|))) (.cse15 (+ .cse7 .cse0)) (.cse16 (< .cse10 c_~N~0)) (.cse9 (+ .cse7 2)) (.cse6 (* c_~N~0 2)) (.cse13 (<= 2 .cse7))) (and (or (= .cse0 |c_main_#t~mem12|) .cse1) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 6 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse5) (< (* 2 v_main_~i~0_215) (+ 7 .cse4))))))) (or (= .cse6 (+ .cse7 4)) (forall ((v_main_~i~0_215 Int)) (or (not (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| .cse9)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse10 v_main_~i~0_215))) .cse11) (= c_~N~0 4) (or (and .cse12 .cse13) .cse11) (or .cse14 (forall ((v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse10 v_main_~i~0_215) (not (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| .cse15)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))))))) (= .cse6 (+ .cse7 2 .cse0))) .cse12 (or (= .cse7 .cse6) .cse16) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse17 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.base|))) (let ((.cse19 (select .cse18 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ .cse19 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 2 .cse19))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 6 .cse19))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse5) (< .cse19 (+ (* c_main_~i~0 2) 1))))))) (or .cse14 (= .cse15 .cse6) .cse16) (or (forall ((v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse10 v_main_~i~0_215) (not (= (select .cse20 (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))) 2)))) (= .cse9 .cse6)) .cse13))))) is different from false [2023-04-01 20:00:17,370 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)))) (let ((.cse2 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse1 (= 2 .cse0))) (let ((.cse5 (not .cse1)) (.cse14 (<= .cse2 2)) (.cse9 (+ c_main_~i~0 3)) (.cse3 (* c_~N~0 2)) (.cse4 (< (+ c_main_~i~0 1) c_~N~0)) (.cse19 (* c_main_~i~0 2)) (.cse13 (+ c_main_~i~0 2)) (.cse15 (<= 2 .cse2))) (and (or (= .cse0 |c_main_#t~mem12|) .cse1) (or (= (+ .cse2 2) .cse3) .cse4 .cse5) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse8 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 2 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 6 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse9) (< (* 2 v_main_~i~0_215) (+ 7 .cse8))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse10 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (let ((.cse12 (select .cse11 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse12 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ 2 .cse12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ 6 .cse12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse13) (< (* 2 v_main_~i~0_215) (+ 7 .cse12))))))) (= c_~N~0 4) (or (and .cse14 .cse15) .cse5) .cse14 (or (= .cse2 .cse3) .cse4) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse16 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse17 (select .cse16 |c_main_~#sum~0.base|))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ .cse18 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ 2 .cse18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ 6 .cse18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse9) (< .cse18 (+ .cse19 1))))))) (or (not (= 2 |c_main_#t~mem12|)) (= (+ .cse2 .cse0) .cse3) .cse4) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse20 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse21 (select .cse20 |c_main_~#sum~0.base|))) (let ((.cse22 (select .cse21 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse22 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ 2 .cse22))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (< (+ .cse22 1) .cse19) (not (= (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ 6 .cse22))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse13)))))) .cse15)))) is different from false [2023-04-01 20:00:18,396 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse12 (select .cse10 |c_main_~#sum~0.offset|)) (.cse18 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse7 (+ c_main_~i~0 1)) (.cse13 (select .cse18 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (.cse19 (+ .cse12 2))) (let ((.cse5 (+ .cse12 4)) (.cse6 (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| .cse19)) c_main_~a~0.base)) (.cse8 (not (= 2 .cse13))) (.cse3 (+ c_main_~i~0 3)) (.cse9 (not (= 2 |c_main_#t~mem12|))) (.cse11 (+ .cse12 .cse13)) (.cse14 (< .cse7 c_~N~0)) (.cse4 (* c_~N~0 2))) (and (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse3) (< (* 2 v_main_~i~0_215) (+ 7 .cse2))))))) (or (= .cse4 .cse5) (forall ((v_main_~i~0_215 Int)) (or (not (= (select .cse6 (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse7 v_main_~i~0_215))) .cse8) (or .cse9 (forall ((v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse7 v_main_~i~0_215) (not (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| .cse11)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))))))) (= .cse4 (+ .cse12 2 .cse13))) (or (= (+ .cse12 6) .cse4) (forall ((v_main_~i~0_216 Int) (v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse7 v_main_~i~0_216) (not (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| .cse5)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))))) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (not (= 2 (select .cse6 (+ c_main_~a~0.offset (* 4 v_main_~i~0_216))))))) .cse8) (or (= .cse12 .cse4) .cse14) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse15 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse16 (select .cse15 |c_main_~#sum~0.base|))) (let ((.cse17 (select .cse16 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ .cse17 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ 2 .cse17))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ 6 .cse17))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse3) (< .cse17 (+ (* c_main_~i~0 2) 1))))))) (or .cse9 (= .cse11 .cse4) .cse14) (or (forall ((v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse7 v_main_~i~0_215) (not (= (select .cse18 (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))) 2)))) (= .cse19 .cse4))))))) is different from false [2023-04-01 20:00:20,859 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse0 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)))) (let ((.cse1 (= 2 .cse0)) (.cse11 (<= .cse2 2)) (.cse6 (+ c_main_~i~0 3)) (.cse16 (* c_main_~i~0 2)) (.cse10 (+ c_main_~i~0 2)) (.cse12 (<= 2 .cse2))) (and (or (= .cse0 |c_main_#t~mem12|) .cse1) (or (< c_main_~i~0 c_~N~0) (= .cse2 (* c_~N~0 2))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse5 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 6 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse6) (< (* 2 v_main_~i~0_215) (+ 7 .cse5))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 2 .cse9))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 6 .cse9))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse10) (< (* 2 v_main_~i~0_215) (+ 7 .cse9))))))) (= c_~N~0 4) (or (and .cse11 .cse12) (not .cse1)) .cse11 (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse14 (select .cse13 |c_main_~#sum~0.base|))) (let ((.cse15 (select .cse14 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ .cse15 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ 2 .cse15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ 6 .cse15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse6) (< .cse15 (+ .cse16 1))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse17 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.base|))) (let ((.cse19 (select .cse18 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ .cse19 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 2 .cse19))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (< (+ .cse19 1) .cse16) (not (= (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 6 .cse19))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse10)))))) .cse12))) is different from false [2023-04-01 20:00:23,055 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-04-01 20:00:50,686 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-04-01 20:00:52,692 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-04-01 20:00:58,739 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse1 (* c_~N~0 2)) (.cse2 (< (+ c_main_~i~0 1) c_~N~0)) (.cse6 (+ c_main_~i~0 3)) (.cse14 (* c_main_~i~0 2)) (.cse10 (+ c_main_~i~0 2))) (and (or (= (+ .cse0 2) .cse1) .cse2 (not (= 2 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse5 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 6 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse6) (< (* 2 v_main_~i~0_215) (+ 7 .cse5))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 2 .cse9))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 6 .cse9))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse10) (< (* 2 v_main_~i~0_215) (+ 7 .cse9))))))) (or (= .cse0 .cse1) .cse2) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse11 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse12 (select .cse11 |c_main_~#sum~0.base|))) (let ((.cse13 (select .cse12 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse11 |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ .cse13 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse11 |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ 2 .cse13))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse11 |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ 6 .cse13))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse6) (< .cse13 (+ .cse14 1))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse15 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse16 (select .cse15 |c_main_~#sum~0.base|))) (let ((.cse17 (select .cse16 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ .cse17 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ 2 .cse17))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (< (+ .cse17 1) .cse14) (not (= (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ 6 .cse17))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse10)))))))) is different from false [2023-04-01 20:01:24,948 WARN L223 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 122 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:01:28,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-04-01 20:01:30,307 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, 1] [2023-04-01 20:01:31,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-04-01 20:01:33,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-04-01 20:01:35,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-04-01 20:01:39,208 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~i~0 3)) (.cse11 (* c_main_~i~0 2)) (.cse7 (+ c_main_~i~0 2))) (and (or (< c_main_~i~0 c_~N~0) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (* c_~N~0 2))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse3) (< (* 2 v_main_~i~0_215) (+ 7 .cse2))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 6 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse7) (< (* 2 v_main_~i~0_215) (+ 7 .cse6))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ 2 .cse10))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ 6 .cse10))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse3) (< .cse10 (+ .cse11 1))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse12 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse13 (select .cse12 |c_main_~#sum~0.base|))) (let ((.cse14 (select .cse13 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse12 |c_main_~#sum~0.base| (store .cse13 |c_main_~#sum~0.offset| (+ .cse14 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse12 |c_main_~#sum~0.base| (store .cse13 |c_main_~#sum~0.offset| (+ 2 .cse14))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (< (+ .cse14 1) .cse11) (not (= (select (select (store .cse12 |c_main_~#sum~0.base| (store .cse13 |c_main_~#sum~0.offset| (+ 6 .cse14))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse7)))))))) is different from false [2023-04-01 20:01:42,417 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-04-01 20:01:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:01:42,472 INFO L93 Difference]: Finished difference Result 207 states and 255 transitions. [2023-04-01 20:01:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-04-01 20:01:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.646153846153846) internal successors, (107), 64 states have internal predecessors, (107), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-04-01 20:01:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:01:42,473 INFO L225 Difference]: With dead ends: 207 [2023-04-01 20:01:42,473 INFO L226 Difference]: Without dead ends: 199 [2023-04-01 20:01:42,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 83 SyntacticMatches, 13 SemanticMatches, 140 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 5187 ImplicationChecksByTransitivity, 74.9s TimeCoverageRelationStatistics Valid=1496, Invalid=16278, Unknown=80, NotChecked=2168, Total=20022 [2023-04-01 20:01:42,477 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 211 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 426 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:01:42,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 224 Invalid, 3922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 2731 Invalid, 26 Unknown, 739 Unchecked, 24.3s Time] [2023-04-01 20:01:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-04-01 20:01:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 128. [2023-04-01 20:01:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 121 states have (on average 1.256198347107438) internal successors, (152), 121 states have internal predecessors, (152), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:01:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2023-04-01 20:01:42,501 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 55 [2023-04-01 20:01:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:01:42,501 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2023-04-01 20:01:42,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.646153846153846) internal successors, (107), 64 states have internal predecessors, (107), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:01:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2023-04-01 20:01:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 20:01:42,502 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:01:42,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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-04-01 20:01:42,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-04-01 20:01:42,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-04-01 20:01:42,705 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:01:42,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:01:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1027276415, now seen corresponding path program 3 times [2023-04-01 20:01:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:01:42,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268318713] [2023-04-01 20:01:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:01:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:01:42,715 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:01:42,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391416945] [2023-04-01 20:01:42,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:01:42,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:42,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:01:42,716 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:01:42,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-04-01 20:01:42,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 20:01:42,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:01:42,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 20:01:42,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:01:42,932 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-04-01 20:01:43,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:43,011 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-04-01 20:01:43,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:43,052 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-04-01 20:01:43,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:43,086 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-04-01 20:01:43,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:01:43,120 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 23 treesize of output 15 [2023-04-01 20:01:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:01:43,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:01:44,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:01:44,193 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 2 case distinctions, treesize of input 39 treesize of output 31 [2023-04-01 20:01:44,200 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 20:01:44,201 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 42 treesize of output 30 [2023-04-01 20:01:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:01:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:01:46,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268318713] [2023-04-01 20:01:46,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:01:46,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391416945] [2023-04-01 20:01:46,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391416945] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:01:46,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:01:46,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-04-01 20:01:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852809273] [2023-04-01 20:01:46,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:01:46,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 20:01:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:01:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 20:01:46,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=230, Unknown=4, NotChecked=0, Total=306 [2023-04-01 20:01:46,253 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:01:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:01:46,764 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2023-04-01 20:01:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 20:01:46,764 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-04-01 20:01:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:01:46,766 INFO L225 Difference]: With dead ends: 200 [2023-04-01 20:01:46,766 INFO L226 Difference]: Without dead ends: 194 [2023-04-01 20:01:46,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=177, Invalid=469, Unknown=4, NotChecked=0, Total=650 [2023-04-01 20:01:46,767 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:01:46,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 20:01:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-04-01 20:01:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 179. [2023-04-01 20:01:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 172 states have internal predecessors, (222), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:01:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2023-04-01 20:01:46,810 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 55 [2023-04-01 20:01:46,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:01:46,811 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2023-04-01 20:01:46,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:01:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2023-04-01 20:01:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 20:01:46,813 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:01:46,814 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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-04-01 20:01:46,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-04-01 20:01:47,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:47,018 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:01:47,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:01:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash -808421697, now seen corresponding path program 3 times [2023-04-01 20:01:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:01:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688651462] [2023-04-01 20:01:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:01:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:01:47,027 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:01:47,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159575081] [2023-04-01 20:01:47,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:01:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:01:47,029 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:01:47,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-04-01 20:01:47,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 20:01:47,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:01:47,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 32 conjunts are in the unsatisfiable core [2023-04-01 20:01:47,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:01:47,218 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-01 20:01:47,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:47,334 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 21 treesize of output 20 [2023-04-01 20:01:47,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:47,389 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 22 [2023-04-01 20:01:47,431 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-04-01 20:01:47,431 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-04-01 20:01:47,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:01:47,541 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 19 treesize of output 15 [2023-04-01 20:01:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:01:47,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:01:52,660 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_262 Int) (v_main_~i~0_260 Int) (v_ArrVal_879 Int) (v_ArrVal_877 Int)) (or (< (+ v_main_~i~0_260 1) c_~N~0) (<= c_~N~0 v_main_~i~0_260) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_877) (+ (* 4 v_main_~i~0_262) c_main_~a~0.offset) v_ArrVal_879) (+ c_main_~a~0.offset (* 4 v_main_~i~0_260))) 1) (< v_main_~i~0_260 (+ v_main_~i~0_262 1)))) is different from false [2023-04-01 20:01:54,694 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_263 Int)) (or (< (+ c_main_~i~0 1) v_main_~i~0_263) (forall ((v_main_~i~0_262 Int) (v_main_~i~0_260 Int) (v_ArrVal_879 Int) (v_ArrVal_877 Int)) (or (< (+ v_main_~i~0_260 1) c_~N~0) (<= c_~N~0 v_main_~i~0_260) (< v_main_~i~0_260 (+ v_main_~i~0_262 1)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_263)) v_ArrVal_877) (+ (* 4 v_main_~i~0_262) c_main_~a~0.offset) v_ArrVal_879) (+ c_main_~a~0.offset (* 4 v_main_~i~0_260))) 1))))) is different from false [2023-04-01 20:02:08,367 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 35 treesize of output 33 [2023-04-01 20:02:08,372 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 830 treesize of output 806 [2023-04-01 20:02:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 10 not checked. [2023-04-01 20:02:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688651462] [2023-04-01 20:02:14,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:02:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159575081] [2023-04-01 20:02:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159575081] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:14,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:02:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2023-04-01 20:02:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640503945] [2023-04-01 20:02:14,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:14,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-04-01 20:02:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-04-01 20:02:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=760, Unknown=12, NotChecked=122, Total=1122 [2023-04-01 20:02:14,979 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:34,339 WARN L223 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 51 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:02:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:38,192 INFO L93 Difference]: Finished difference Result 190 states and 239 transitions. [2023-04-01 20:02:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 20:02:38,192 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-04-01 20:02:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:38,193 INFO L225 Difference]: With dead ends: 190 [2023-04-01 20:02:38,193 INFO L226 Difference]: Without dead ends: 132 [2023-04-01 20:02:38,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=688, Invalid=1955, Unknown=17, NotChecked=202, Total=2862 [2023-04-01 20:02:38,194 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 96 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:38,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 171 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 365 Invalid, 0 Unknown, 96 Unchecked, 0.4s Time] [2023-04-01 20:02:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-04-01 20:02:38,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2023-04-01 20:02:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 117 states have (on average 1.2307692307692308) internal successors, (144), 117 states have internal predecessors, (144), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:02:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2023-04-01 20:02:38,219 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 55 [2023-04-01 20:02:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:38,219 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2023-04-01 20:02:38,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2023-04-01 20:02:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-04-01 20:02:38,219 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:38,220 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:02:38,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-04-01 20:02:38,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:38,425 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:38,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash -974182882, now seen corresponding path program 11 times [2023-04-01 20:02:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971215985] [2023-04-01 20:02:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:02:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:38,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:02:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:02:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:38,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971215985] [2023-04-01 20:02:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971215985] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:02:38,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494567808] [2023-04-01 20:02:38,600 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 20:02:38,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:38,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:38,602 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:02:38,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-04-01 20:02:38,751 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-04-01 20:02:38,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:02:38,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 20:02:38,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:02:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 20:02:38,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-04-01 20:02:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494567808] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:39,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:02:39,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2023-04-01 20:02:39,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80589473] [2023-04-01 20:02:39,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:39,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 20:02:39,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 20:02:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2023-04-01 20:02:39,001 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:39,300 INFO L93 Difference]: Finished difference Result 203 states and 243 transitions. [2023-04-01 20:02:39,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 20:02:39,300 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2023-04-01 20:02:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:39,301 INFO L225 Difference]: With dead ends: 203 [2023-04-01 20:02:39,301 INFO L226 Difference]: Without dead ends: 108 [2023-04-01 20:02:39,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2023-04-01 20:02:39,302 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:39,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 63 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 20:02:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-04-01 20:02:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2023-04-01 20:02:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 74 states have internal predecessors, (87), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:02:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2023-04-01 20:02:39,319 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 58 [2023-04-01 20:02:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:39,319 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2023-04-01 20:02:39,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 20 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2023-04-01 20:02:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-04-01 20:02:39,319 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:39,319 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 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-04-01 20:02:39,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-04-01 20:02:39,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:39,522 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:39,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1528113369, now seen corresponding path program 4 times [2023-04-01 20:02:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:39,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795971794] [2023-04-01 20:02:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:39,536 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:02:39,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356711097] [2023-04-01 20:02:39,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 20:02:39,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:39,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:39,537 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:02:39,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-04-01 20:02:39,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 20:02:39,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:02:39,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 20:02:39,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:02:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 20:02:39,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 20:02:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795971794] [2023-04-01 20:02:39,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:02:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356711097] [2023-04-01 20:02:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356711097] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:39,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:02:39,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-04-01 20:02:39,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869551115] [2023-04-01 20:02:39,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:39,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 20:02:39,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:39,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 20:02:39,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-04-01 20:02:39,894 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:40,183 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2023-04-01 20:02:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-01 20:02:40,185 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2023-04-01 20:02:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:40,186 INFO L225 Difference]: With dead ends: 107 [2023-04-01 20:02:40,186 INFO L226 Difference]: Without dead ends: 101 [2023-04-01 20:02:40,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2023-04-01 20:02:40,186 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 109 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:40,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 87 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 20:02:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-04-01 20:02:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2023-04-01 20:02:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:02:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-04-01 20:02:40,202 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 60 [2023-04-01 20:02:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:40,202 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-04-01 20:02:40,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-04-01 20:02:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-04-01 20:02:40,203 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:40,203 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:02:40,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-04-01 20:02:40,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-04-01 20:02:40,407 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:40,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1530161726, now seen corresponding path program 12 times [2023-04-01 20:02:40,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:40,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322749694] [2023-04-01 20:02:40,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:41,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:02:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:41,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:02:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 20:02:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322749694] [2023-04-01 20:02:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322749694] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:02:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885122603] [2023-04-01 20:02:41,556 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-01 20:02:41,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:41,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:41,557 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:02:41,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-04-01 20:02:41,711 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-04-01 20:02:41,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:02:41,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 88 conjunts are in the unsatisfiable core [2023-04-01 20:02:41,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:02:41,827 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:02:41,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:41,889 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-04-01 20:02:41,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:41,950 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-04-01 20:02:42,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,013 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-04-01 20:02:42,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,032 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-04-01 20:02:42,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,047 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-04-01 20:02:42,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,085 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-04-01 20:02:42,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,115 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-04-01 20:02:42,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,185 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-04-01 20:02:42,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,264 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-04-01 20:02:42,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,398 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-04-01 20:02:42,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,587 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-04-01 20:02:42,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,719 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:42,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:42,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:42,868 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:42,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:43,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:43,025 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:43,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:43,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:43,210 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:43,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 20:02:43,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:47,198 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:47,198 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 1 case distinctions, treesize of input 141 treesize of output 1 [2023-04-01 20:02:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 20:02:47,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885122603] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:47,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:02:47,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27, 25] total 74 [2023-04-01 20:02:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998013657] [2023-04-01 20:02:47,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:47,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-04-01 20:02:47,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:47,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-04-01 20:02:47,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=5069, Unknown=2, NotChecked=0, Total=5402 [2023-04-01 20:02:47,224 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 74 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 70 states have internal predecessors, (132), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:03:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:05,403 INFO L93 Difference]: Finished difference Result 238 states and 293 transitions. [2023-04-01 20:03:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-04-01 20:03:05,403 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 70 states have internal predecessors, (132), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 63 [2023-04-01 20:03:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:05,404 INFO L225 Difference]: With dead ends: 238 [2023-04-01 20:03:05,404 INFO L226 Difference]: Without dead ends: 232 [2023-04-01 20:03:05,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5804 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1725, Invalid=19431, Unknown=14, NotChecked=0, Total=21170 [2023-04-01 20:03:05,406 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 176 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 3936 mSolverCounterSat, 401 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 4390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 3936 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:05,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 179 Invalid, 4390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 3936 Invalid, 53 Unknown, 0 Unchecked, 6.8s Time] [2023-04-01 20:03:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-04-01 20:03:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 169. [2023-04-01 20:03:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 162 states have (on average 1.2469135802469136) internal successors, (202), 162 states have internal predecessors, (202), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:03:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 208 transitions. [2023-04-01 20:03:05,456 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 208 transitions. Word has length 63 [2023-04-01 20:03:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:05,456 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 208 transitions. [2023-04-01 20:03:05,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 70 states have internal predecessors, (132), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:03:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 208 transitions. [2023-04-01 20:03:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-04-01 20:03:05,457 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:05,457 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 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-04-01 20:03:05,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:05,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-04-01 20:03:05,662 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:05,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2063740992, now seen corresponding path program 4 times [2023-04-01 20:03:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:05,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44905550] [2023-04-01 20:03:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:05,677 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:03:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119227942] [2023-04-01 20:03:05,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 20:03:05,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:05,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:05,681 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:03:05,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-04-01 20:03:05,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 20:03:05,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:05,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 37 conjunts are in the unsatisfiable core [2023-04-01 20:03:05,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:05,827 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 10 treesize of output 8 [2023-04-01 20:03:05,936 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 13 [2023-04-01 20:03:05,987 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-04-01 20:03:05,987 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 1 case distinctions, treesize of input 25 treesize of output 24 [2023-04-01 20:03:06,036 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-04-01 20:03:06,069 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-04-01 20:03:06,105 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-04-01 20:03:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-04-01 20:03:06,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:06,534 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 47 treesize of output 43 [2023-04-01 20:03:06,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:03:06,542 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 115 treesize of output 109 [2023-04-01 20:03:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-04-01 20:03:06,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:06,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44905550] [2023-04-01 20:03:06,611 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:03:06,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119227942] [2023-04-01 20:03:06,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119227942] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:06,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:03:06,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2023-04-01 20:03:06,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547770638] [2023-04-01 20:03:06,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:06,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 20:03:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:06,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 20:03:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=505, Unknown=2, NotChecked=0, Total=600 [2023-04-01 20:03:06,613 INFO L87 Difference]: Start difference. First operand 169 states and 208 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:07,292 INFO L93 Difference]: Finished difference Result 279 states and 356 transitions. [2023-04-01 20:03:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 20:03:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-04-01 20:03:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:07,293 INFO L225 Difference]: With dead ends: 279 [2023-04-01 20:03:07,293 INFO L226 Difference]: Without dead ends: 253 [2023-04-01 20:03:07,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=591, Unknown=2, NotChecked=0, Total=702 [2023-04-01 20:03:07,294 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:07,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 224 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 20:03:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-04-01 20:03:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 221. [2023-04-01 20:03:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 214 states have (on average 1.2476635514018692) internal successors, (267), 214 states have internal predecessors, (267), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:03:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 273 transitions. [2023-04-01 20:03:07,355 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 273 transitions. Word has length 63 [2023-04-01 20:03:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:07,356 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 273 transitions. [2023-04-01 20:03:07,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 273 transitions. [2023-04-01 20:03:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-04-01 20:03:07,356 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:07,356 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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-04-01 20:03:07,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:07,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:07,561 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:07,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:07,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1721753214, now seen corresponding path program 5 times [2023-04-01 20:03:07,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:07,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637856502] [2023-04-01 20:03:07,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:07,571 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:03:07,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188554819] [2023-04-01 20:03:07,572 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 20:03:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:07,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:07,573 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:03:07,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-04-01 20:03:07,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-04-01 20:03:07,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:07,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 34 conjunts are in the unsatisfiable core [2023-04-01 20:03:07,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:07,967 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:03:08,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:08,002 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 21 treesize of output 20 [2023-04-01 20:03:08,049 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 19 treesize of output 18 [2023-04-01 20:03:08,082 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 19 treesize of output 18 [2023-04-01 20:03:08,117 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 19 treesize of output 18 [2023-04-01 20:03:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-04-01 20:03:08,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:08,370 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 23 treesize of output 21 [2023-04-01 20:03:08,373 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 42 treesize of output 38 [2023-04-01 20:03:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-04-01 20:03:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637856502] [2023-04-01 20:03:08,460 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:03:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188554819] [2023-04-01 20:03:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188554819] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:08,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:03:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-04-01 20:03:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580885741] [2023-04-01 20:03:08,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:08,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 20:03:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:08,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 20:03:08,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2023-04-01 20:03:08,462 INFO L87 Difference]: Start difference. First operand 221 states and 273 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:09,027 INFO L93 Difference]: Finished difference Result 251 states and 311 transitions. [2023-04-01 20:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 20:03:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-04-01 20:03:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:09,028 INFO L225 Difference]: With dead ends: 251 [2023-04-01 20:03:09,028 INFO L226 Difference]: Without dead ends: 163 [2023-04-01 20:03:09,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2023-04-01 20:03:09,029 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:09,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 335 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 20:03:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-04-01 20:03:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2023-04-01 20:03:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.1935483870967742) internal successors, (185), 155 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:03:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 191 transitions. [2023-04-01 20:03:09,071 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 191 transitions. Word has length 63 [2023-04-01 20:03:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:09,072 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 191 transitions. [2023-04-01 20:03:09,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 191 transitions. [2023-04-01 20:03:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-04-01 20:03:09,072 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:09,072 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:03:09,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:09,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:09,276 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:09,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash -58323517, now seen corresponding path program 13 times [2023-04-01 20:03:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:09,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417991314] [2023-04-01 20:03:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:03:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:09,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:03:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:03:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417991314] [2023-04-01 20:03:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417991314] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:03:09,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126077627] [2023-04-01 20:03:09,482 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 20:03:09,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:09,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:09,483 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:03:09,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-04-01 20:03:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:09,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 20:03:09,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:03:09,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:03:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126077627] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:09,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:03:09,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2023-04-01 20:03:09,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870940445] [2023-04-01 20:03:09,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:09,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 20:03:09,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:09,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 20:03:09,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-04-01 20:03:09,938 INFO L87 Difference]: Start difference. First operand 162 states and 191 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:10,343 INFO L93 Difference]: Finished difference Result 226 states and 264 transitions. [2023-04-01 20:03:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-01 20:03:10,343 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2023-04-01 20:03:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:10,344 INFO L225 Difference]: With dead ends: 226 [2023-04-01 20:03:10,344 INFO L226 Difference]: Without dead ends: 107 [2023-04-01 20:03:10,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 118 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2023-04-01 20:03:10,344 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 141 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:10,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 56 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:03:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-04-01 20:03:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2023-04-01 20:03:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.144736842105263) internal successors, (87), 76 states have internal predecessors, (87), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:03:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2023-04-01 20:03:10,362 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 66 [2023-04-01 20:03:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:10,362 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2023-04-01 20:03:10,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2023-04-01 20:03:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-04-01 20:03:10,362 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:10,363 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:03:10,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:10,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-04-01 20:03:10,563 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:10,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1762601126, now seen corresponding path program 14 times [2023-04-01 20:03:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:10,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106535628] [2023-04-01 20:03:10,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:10,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:03:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:10,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:03:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:10,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106535628] [2023-04-01 20:03:10,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106535628] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:03:10,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290145499] [2023-04-01 20:03:10,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 20:03:10,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:10,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:10,765 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:03:10,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-04-01 20:03:10,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 20:03:10,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:10,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 20:03:10,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:11,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290145499] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:11,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:03:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2023-04-01 20:03:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242610267] [2023-04-01 20:03:11,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:11,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 20:03:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:11,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 20:03:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-04-01 20:03:11,220 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:11,693 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2023-04-01 20:03:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-01 20:03:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-04-01 20:03:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:11,694 INFO L225 Difference]: With dead ends: 106 [2023-04-01 20:03:11,694 INFO L226 Difference]: Without dead ends: 100 [2023-04-01 20:03:11,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 120 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 20:03:11,695 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 136 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:11,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 58 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:03:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-04-01 20:03:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2023-04-01 20:03:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 79 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:03:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2023-04-01 20:03:11,718 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 68 [2023-04-01 20:03:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:11,718 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2023-04-01 20:03:11,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2023-04-01 20:03:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-04-01 20:03:11,718 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:11,718 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:03:11,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:11,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-04-01 20:03:11,921 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:11,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1998374105, now seen corresponding path program 15 times [2023-04-01 20:03:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:11,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395603657] [2023-04-01 20:03:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:13,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:03:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:13,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:03:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 20:03:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395603657] [2023-04-01 20:03:13,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395603657] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:03:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143811188] [2023-04-01 20:03:13,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:03:13,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:13,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:13,756 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:03:13,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-04-01 20:03:13,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-01 20:03:13,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:13,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 94 conjunts are in the unsatisfiable core [2023-04-01 20:03:13,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:14,066 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:03:14,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,120 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-04-01 20:03:14,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,135 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-04-01 20:03:14,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,152 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-04-01 20:03:14,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,166 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-04-01 20:03:14,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,189 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-04-01 20:03:14,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,207 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-04-01 20:03:14,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,292 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-04-01 20:03:14,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,374 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-04-01 20:03:14,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,444 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-04-01 20:03:14,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,520 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-04-01 20:03:14,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,592 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-04-01 20:03:14,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,722 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-04-01 20:03:14,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:14,923 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-04-01 20:03:15,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:15,080 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:15,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:15,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:15,254 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:15,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:15,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:15,451 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:15,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:15,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:15,652 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:15,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:15,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:15,852 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:15,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-04-01 20:03:16,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:20,205 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:20,205 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 1 case distinctions, treesize of input 141 treesize of output 1 [2023-04-01 20:03:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-04-01 20:03:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143811188] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:20,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:03:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 28] total 85 [2023-04-01 20:03:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761573444] [2023-04-01 20:03:20,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:20,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2023-04-01 20:03:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:20,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2023-04-01 20:03:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=6729, Unknown=2, NotChecked=0, Total=7140 [2023-04-01 20:03:20,229 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 85 states, 83 states have (on average 1.783132530120482) internal successors, (148), 81 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:03:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:40,012 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2023-04-01 20:03:40,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-04-01 20:03:40,013 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 83 states have (on average 1.783132530120482) internal successors, (148), 81 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2023-04-01 20:03:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:40,013 INFO L225 Difference]: With dead ends: 242 [2023-04-01 20:03:40,013 INFO L226 Difference]: Without dead ends: 236 [2023-04-01 20:03:40,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5997 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=1639, Invalid=20396, Unknown=17, NotChecked=0, Total=22052 [2023-04-01 20:03:40,015 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 135 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 5203 mSolverCounterSat, 327 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 5594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 5203 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:40,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 209 Invalid, 5594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 5203 Invalid, 64 Unknown, 0 Unchecked, 8.5s Time] [2023-04-01 20:03:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-04-01 20:03:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 187. [2023-04-01 20:03:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 180 states have (on average 1.211111111111111) internal successors, (218), 180 states have internal predecessors, (218), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:03:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 224 transitions. [2023-04-01 20:03:40,081 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 224 transitions. Word has length 71 [2023-04-01 20:03:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:40,081 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 224 transitions. [2023-04-01 20:03:40,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 83 states have (on average 1.783132530120482) internal successors, (148), 81 states have internal predecessors, (148), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:03:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 224 transitions. [2023-04-01 20:03:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-04-01 20:03:40,082 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:40,082 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 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-04-01 20:03:40,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:40,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-04-01 20:03:40,287 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:40,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1297309527, now seen corresponding path program 5 times [2023-04-01 20:03:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:40,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011029924] [2023-04-01 20:03:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:40,299 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:03:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971600872] [2023-04-01 20:03:40,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 20:03:40,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:40,300 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:03:40,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-04-01 20:03:40,744 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-04-01 20:03:40,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:40,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 54 conjunts are in the unsatisfiable core [2023-04-01 20:03:40,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:40,756 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 10 treesize of output 8 [2023-04-01 20:03:40,936 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 19 treesize of output 11 [2023-04-01 20:03:40,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:40,985 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 21 treesize of output 20 [2023-04-01 20:03:41,040 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-04-01 20:03:41,078 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-04-01 20:03:41,114 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-04-01 20:03:41,163 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-04-01 20:03:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 23 proven. 109 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 20:03:41,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:41,259 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1645) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2023-04-01 20:03:41,347 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1645) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)) 2)) is different from false [2023-04-01 20:03:41,357 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1645) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) is different from false [2023-04-01 20:03:41,586 INFO L321 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2023-04-01 20:03:41,587 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 3 case distinctions, treesize of input 44 treesize of output 41 [2023-04-01 20:03:41,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:03:41,595 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 38 treesize of output 32 [2023-04-01 20:03:41,600 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-04-01 20:03:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 28 not checked. [2023-04-01 20:03:41,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:41,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011029924] [2023-04-01 20:03:41,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:03:41,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971600872] [2023-04-01 20:03:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971600872] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:41,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:03:41,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2023-04-01 20:03:41,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981071008] [2023-04-01 20:03:41,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:41,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-01 20:03:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:41,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-01 20:03:41,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=850, Unknown=11, NotChecked=186, Total=1190 [2023-04-01 20:03:41,867 INFO L87 Difference]: Start difference. First operand 187 states and 224 transitions. Second operand has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:43,132 INFO L93 Difference]: Finished difference Result 296 states and 362 transitions. [2023-04-01 20:03:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 20:03:43,132 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2023-04-01 20:03:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:43,133 INFO L225 Difference]: With dead ends: 296 [2023-04-01 20:03:43,133 INFO L226 Difference]: Without dead ends: 285 [2023-04-01 20:03:43,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=960, Unknown=11, NotChecked=198, Total=1332 [2023-04-01 20:03:43,134 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:43,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 297 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1423 Invalid, 0 Unknown, 277 Unchecked, 1.0s Time] [2023-04-01 20:03:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-04-01 20:03:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 251. [2023-04-01 20:03:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 244 states have (on average 1.209016393442623) internal successors, (295), 244 states have internal predecessors, (295), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:03:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 301 transitions. [2023-04-01 20:03:43,216 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 301 transitions. Word has length 71 [2023-04-01 20:03:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:43,216 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 301 transitions. [2023-04-01 20:03:43,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 301 transitions. [2023-04-01 20:03:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-04-01 20:03:43,217 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:43,217 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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-04-01 20:03:43,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:43,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-04-01 20:03:43,425 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:43,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash -595709653, now seen corresponding path program 6 times [2023-04-01 20:03:43,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:43,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361158296] [2023-04-01 20:03:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:43,437 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:03:43,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43925656] [2023-04-01 20:03:43,437 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-01 20:03:43,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:43,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:43,438 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:03:43,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-04-01 20:03:43,681 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-04-01 20:03:43,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:43,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 45 conjunts are in the unsatisfiable core [2023-04-01 20:03:43,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:43,759 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:03:43,815 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-04-01 20:03:43,816 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-04-01 20:03:43,992 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-04-01 20:03:43,993 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2023-04-01 20:03:44,130 INFO L321 Elim1Store]: treesize reduction 34, result has 42.4 percent of original size [2023-04-01 20:03:44,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2023-04-01 20:03:44,391 INFO L321 Elim1Store]: treesize reduction 26, result has 55.9 percent of original size [2023-04-01 20:03:44,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 69 [2023-04-01 20:03:45,007 INFO L321 Elim1Store]: treesize reduction 26, result has 55.9 percent of original size [2023-04-01 20:03:45,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 85 [2023-04-01 20:03:45,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:03:45,600 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 120 [2023-04-01 20:03:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:46,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:47,093 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 17 [2023-04-01 20:03:47,097 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 23 treesize of output 16 [2023-04-01 20:03:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 25 proven. 62 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:47,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361158296] [2023-04-01 20:03:47,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:03:47,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43925656] [2023-04-01 20:03:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43925656] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:47,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:03:47,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 40 [2023-04-01 20:03:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347108058] [2023-04-01 20:03:47,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:47,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-04-01 20:03:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:47,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-04-01 20:03:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1327, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 20:03:47,286 INFO L87 Difference]: Start difference. First operand 251 states and 301 transitions. Second operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:54,705 WARN L223 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 73 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)