/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/s3if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 01:31:20,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 01:31:20,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 01:31:20,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 01:31:20,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 01:31:20,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 01:31:20,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 01:31:20,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 01:31:20,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 01:31:20,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 01:31:20,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 01:31:20,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 01:31:20,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 01:31:20,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 01:31:20,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 01:31:20,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 01:31:20,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 01:31:20,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 01:31:20,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 01:31:20,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 01:31:20,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 01:31:20,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 01:31:20,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 01:31:20,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 01:31:20,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 01:31:20,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 01:31:20,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 01:31:20,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 01:31:20,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 01:31:20,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 01:31:20,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 01:31:20,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 01:31:20,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 01:31:20,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 01:31:20,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 01:31:20,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 01:31:20,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 01:31:20,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 01:31:20,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 01:31:20,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 01:31:20,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 01:31:20,201 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 [2022-01-31 01:31:20,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 01:31:20,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 01:31:20,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 01:31:20,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 01:31:20,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 01:31:20,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 01:31:20,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 01:31:20,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 01:31:20,225 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 01:31:20,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 01:31:20,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 01:31:20,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 01:31:20,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 01:31:20,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 01:31:20,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 01:31:20,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 01:31:20,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:31:20,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 01:31:20,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 01:31:20,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 01:31:20,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 01:31:20,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 01:31:20,228 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 01:31:20,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 01:31:20,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 01:31:20,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 01:31:20,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 01:31:20,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 01:31:20,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 01:31:20,437 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 01:31:20,442 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 01:31:20,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s3if.c [2022-01-31 01:31:20,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5a08eadc/1b2b301e8e834386801749c25cc31388/FLAG47905dc3c [2022-01-31 01:31:20,875 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 01:31:20,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s3if.c [2022-01-31 01:31:20,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5a08eadc/1b2b301e8e834386801749c25cc31388/FLAG47905dc3c [2022-01-31 01:31:21,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5a08eadc/1b2b301e8e834386801749c25cc31388 [2022-01-31 01:31:21,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 01:31:21,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 01:31:21,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 01:31:21,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 01:31:21,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 01:31:21,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3df6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21, skipping insertion in model container [2022-01-31 01:31:21,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 01:31:21,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 01:31:21,454 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s3if.c[587,600] [2022-01-31 01:31:21,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:31:21,477 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 01:31:21,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s3if.c[587,600] [2022-01-31 01:31:21,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:31:21,498 INFO L208 MainTranslator]: Completed translation [2022-01-31 01:31:21,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21 WrapperNode [2022-01-31 01:31:21,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 01:31:21,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 01:31:21,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 01:31:21,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 01:31:21,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 01:31:21,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 01:31:21,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 01:31:21,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 01:31:21,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (1/1) ... [2022-01-31 01:31:21,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:31:21,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:21,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 01:31:21,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 01:31:21,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 01:31:21,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 01:31:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 01:31:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 01:31:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 01:31:21,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 01:31:21,625 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 01:31:21,625 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 01:31:21,625 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 01:31:21,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 01:31:21,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 01:31:21,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 01:31:21,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 01:31:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 01:31:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 01:31:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 01:31:21,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 01:31:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 01:31:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 01:31:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 01:31:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 01:31:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 01:31:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 01:31:21,683 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 01:31:21,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 01:31:21,858 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 01:31:21,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 01:31:21,862 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 01:31:21,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:31:21 BoogieIcfgContainer [2022-01-31 01:31:21,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 01:31:21,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 01:31:21,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 01:31:21,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 01:31:21,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:31:21" (1/3) ... [2022-01-31 01:31:21,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9de40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:31:21, skipping insertion in model container [2022-01-31 01:31:21,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:31:21" (2/3) ... [2022-01-31 01:31:21,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9de40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:31:21, skipping insertion in model container [2022-01-31 01:31:21,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:31:21" (3/3) ... [2022-01-31 01:31:21,868 INFO L111 eAbstractionObserver]: Analyzing ICFG s3if.c [2022-01-31 01:31:21,871 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 01:31:21,872 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 01:31:21,916 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 01:31:21,921 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 01:31:21,921 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 01:31:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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) [2022-01-31 01:31:21,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 01:31:21,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:21,935 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:31:21,935 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:21,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash 863653859, now seen corresponding path program 1 times [2022-01-31 01:31:21,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:21,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721737838] [2022-01-31 01:31:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:21,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:22,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:22,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721737838] [2022-01-31 01:31:22,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721737838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:31:22,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:31:22,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 01:31:22,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678150881] [2022-01-31 01:31:22,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:31:22,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 01:31:22,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:22,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 01:31:22,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:31:22,171 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-01-31 01:31:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:22,233 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-01-31 01:31:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 01:31:22,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 21 [2022-01-31 01:31:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:22,242 INFO L225 Difference]: With dead ends: 54 [2022-01-31 01:31:22,242 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 01:31:22,244 INFO L932 BasicCegarLoop]: 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 [2022-01-31 01:31:22,249 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:22,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:31:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 01:31:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 01:31:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2022-01-31 01:31:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-01-31 01:31:22,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-01-31 01:31:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:22,283 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-01-31 01:31:22,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2022-01-31 01:31:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-01-31 01:31:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 01:31:22,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:22,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:31:22,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 01:31:22,286 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1121819297, now seen corresponding path program 1 times [2022-01-31 01:31:22,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:22,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789274946] [2022-01-31 01:31:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:22,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:22,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:22,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789274946] [2022-01-31 01:31:22,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789274946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:31:22,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:31:22,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 01:31:22,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59258304] [2022-01-31 01:31:22,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:31:22,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 01:31:22,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:22,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 01:31:22,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 01:31:22,418 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-01-31 01:31:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:22,483 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-01-31 01:31:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 01:31:22,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2022-01-31 01:31:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:22,486 INFO L225 Difference]: With dead ends: 40 [2022-01-31 01:31:22,486 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 01:31:22,489 INFO L932 BasicCegarLoop]: 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 [2022-01-31 01:31:22,492 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:22,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 24 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:31:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 01:31:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-01-31 01:31:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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) [2022-01-31 01:31:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-01-31 01:31:22,509 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2022-01-31 01:31:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:22,509 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-01-31 01:31:22,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-01-31 01:31:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-01-31 01:31:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:31:22,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:22,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:31:22,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 01:31:22,510 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash -667943349, now seen corresponding path program 1 times [2022-01-31 01:31:22,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:22,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168274242] [2022-01-31 01:31:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:22,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:22,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:22,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168274242] [2022-01-31 01:31:22,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168274242] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:22,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800511230] [2022-01-31 01:31:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:22,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:22,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:22,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:31:22,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 01:31:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:22,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 01:31:22,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:23,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:31:23,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:31:23,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:23,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:31:23,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2022-01-31 01:31:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:23,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:23,615 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:31:23,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-31 01:31:23,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:31:23,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-01-31 01:31:23,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-31 01:31:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:23,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800511230] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:23,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:23,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 25 [2022-01-31 01:31:23,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117975756] [2022-01-31 01:31:23,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:23,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 01:31:23,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:23,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 01:31:23,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=497, Unknown=1, NotChecked=0, Total=600 [2022-01-31 01:31:23,680 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 25 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:31:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:23,950 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-01-31 01:31:23,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:31:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-01-31 01:31:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:23,952 INFO L225 Difference]: With dead ends: 46 [2022-01-31 01:31:23,952 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 01:31:23,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=815, Unknown=1, NotChecked=0, Total=992 [2022-01-31 01:31:23,954 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:23,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 84 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 217 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2022-01-31 01:31:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 01:31:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-01-31 01:31:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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) [2022-01-31 01:31:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-01-31 01:31:23,959 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 26 [2022-01-31 01:31:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:23,959 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-01-31 01:31:23,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:31:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-01-31 01:31:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:31:23,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:23,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:31:23,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 01:31:24,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:24,190 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1477289975, now seen corresponding path program 1 times [2022-01-31 01:31:24,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:24,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018170366] [2022-01-31 01:31:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:24,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:24,200 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:31:24,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129448263] [2022-01-31 01:31:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:24,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:24,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:31:24,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 01:31:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:24,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 01:31:24,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:24,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:31:24,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 01:31:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:24,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:24,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-01-31 01:31:24,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-31 01:31:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:24,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018170366] [2022-01-31 01:31:24,426 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:31:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129448263] [2022-01-31 01:31:24,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129448263] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:24,426 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:31:24,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 01:31:24,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478968493] [2022-01-31 01:31:24,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:24,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 01:31:24,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 01:31:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 01:31:24,427 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-01-31 01:31:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:24,482 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-31 01:31:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 01:31:24,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2022-01-31 01:31:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:24,486 INFO L225 Difference]: With dead ends: 50 [2022-01-31 01:31:24,486 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 01:31:24,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 01:31:24,490 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:24,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 108 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:31:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 01:31:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 01:31:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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) [2022-01-31 01:31:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 01:31:24,500 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2022-01-31 01:31:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:24,501 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 01:31:24,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-01-31 01:31:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 01:31:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 01:31:24,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:24,501 INFO L514 BasicCegarLoop]: 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] [2022-01-31 01:31:24,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:24,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 01:31:24,723 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:24,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1722810441, now seen corresponding path program 2 times [2022-01-31 01:31:24,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:24,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782968129] [2022-01-31 01:31:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:24,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:24,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:24,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782968129] [2022-01-31 01:31:24,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782968129] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:24,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164963450] [2022-01-31 01:31:24,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:31:24,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:24,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:24,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:31:24,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 01:31:24,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:31:24,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:24,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:31:24,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:24,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:24,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164963450] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:24,960 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:24,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:31:24,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063348695] [2022-01-31 01:31:24,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:24,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:31:24,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:24,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:31:24,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:31:24,961 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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) [2022-01-31 01:31:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:25,135 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-01-31 01:31:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:31:25,136 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 28 [2022-01-31 01:31:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:25,136 INFO L225 Difference]: With dead ends: 45 [2022-01-31 01:31:25,136 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 01:31:25,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 01:31:25,137 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:25,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:31:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 01:31:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-01-31 01:31:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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) [2022-01-31 01:31:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 01:31:25,141 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-01-31 01:31:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:25,142 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 01:31:25,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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) [2022-01-31 01:31:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 01:31:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 01:31:25,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:25,142 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:31:25,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:25,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:25,352 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:25,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:25,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1559730403, now seen corresponding path program 3 times [2022-01-31 01:31:25,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:25,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287207704] [2022-01-31 01:31:25,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:25,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:25,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:25,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:25,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287207704] [2022-01-31 01:31:25,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287207704] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:25,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349453289] [2022-01-31 01:31:25,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:31:25,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:25,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:31:25,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 01:31:25,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 01:31:25,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:25,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:31:25,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:25,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:25,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349453289] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:25,599 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:25,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:31:25,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418746458] [2022-01-31 01:31:25,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:25,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:31:25,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:31:25,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:31:25,600 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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) [2022-01-31 01:31:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:25,702 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-31 01:31:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:31:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 29 [2022-01-31 01:31:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:25,703 INFO L225 Difference]: With dead ends: 49 [2022-01-31 01:31:25,703 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 01:31:25,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:31:25,706 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:25,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:31:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 01:31:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-31 01:31:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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) [2022-01-31 01:31:25,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 01:31:25,720 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-01-31 01:31:25,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:25,721 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 01:31:25,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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) [2022-01-31 01:31:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 01:31:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:31:25,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:25,723 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:31:25,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:25,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:25,936 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1063218725, now seen corresponding path program 4 times [2022-01-31 01:31:25,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:25,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902943582] [2022-01-31 01:31:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:25,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:26,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:26,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:26,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902943582] [2022-01-31 01:31:26,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902943582] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:26,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787357525] [2022-01-31 01:31:26,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:31:26,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:26,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:26,416 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:31:26,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 01:31:26,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:31:26,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:26,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 01:31:26,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:26,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:31:26,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:26,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:26,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:26,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:26,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:26,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:31:26,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:26,783 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:26,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-01-31 01:31:26,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:26,911 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:26,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 21 [2022-01-31 01:31:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:26,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:30,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_47 Int) (v_ArrVal_153 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_44 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_153))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_153 (+ main_~a~0.offset (* v_main_~i~0_47 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))))) (or (= (* 3 ~N~0) (+ .cse0 .cse1 .cse2)) (not (= .cse1 3)) (not (= .cse0 3)))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:31:30,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_main_~i~0_47 Int) (v_ArrVal_153 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_44 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_153))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_153 (+ main_~a~0.offset (* v_main_~i~0_47 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))))) (or (= (* 3 ~N~0) (+ .cse0 .cse1 .cse2)) (not (= .cse1 3)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse0 3)) (< (+ c_main_~i~0 2) ~N~0))))))) is different from false [2022-01-31 01:31:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-31 01:31:30,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787357525] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:30,884 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:30,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2022-01-31 01:31:30,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790652474] [2022-01-31 01:31:30,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:30,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 01:31:30,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:30,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 01:31:30,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1129, Unknown=3, NotChecked=138, Total=1406 [2022-01-31 01:31:30,885 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 states have internal predecessors, (58), 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) [2022-01-31 01:31:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:31,185 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-31 01:31:31,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:31:31,185 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 states have internal predecessors, (58), 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 31 [2022-01-31 01:31:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:31,186 INFO L225 Difference]: With dead ends: 49 [2022-01-31 01:31:31,186 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 01:31:31,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=204, Invalid=1523, Unknown=3, NotChecked=162, Total=1892 [2022-01-31 01:31:31,187 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:31,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 166 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 262 Invalid, 0 Unknown, 239 Unchecked, 0.1s Time] [2022-01-31 01:31:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 01:31:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-01-31 01:31:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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) [2022-01-31 01:31:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 01:31:31,192 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2022-01-31 01:31:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:31,192 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 01:31:31,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 states have internal predecessors, (58), 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) [2022-01-31 01:31:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 01:31:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:31:31,193 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:31,193 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:31:31,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-31 01:31:31,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:31,393 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 253872099, now seen corresponding path program 1 times [2022-01-31 01:31:31,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:31,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558577409] [2022-01-31 01:31:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:31,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:31,422 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:31:31,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790998400] [2022-01-31 01:31:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:31,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:31,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:31,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:31:31,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 01:31:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:31,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 01:31:31,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:31,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:31:31,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:31,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:31:31,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 01:31:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:31,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:31,662 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_190) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:31:31,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_190) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:31:31,683 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:31:31,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:31:31,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:31:31,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:31:31,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:31:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-31 01:31:31,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:31,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558577409] [2022-01-31 01:31:31,752 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:31:31,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790998400] [2022-01-31 01:31:31,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790998400] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:31,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:31:31,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-31 01:31:31,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877999057] [2022-01-31 01:31:31,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:31,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:31:31,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:31,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:31:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-01-31 01:31:31,753 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 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) [2022-01-31 01:31:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:31,891 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-01-31 01:31:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 01:31:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 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 [2022-01-31 01:31:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:31,892 INFO L225 Difference]: With dead ends: 53 [2022-01-31 01:31:31,892 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 01:31:31,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2022-01-31 01:31:31,893 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:31,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 126 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-01-31 01:31:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 01:31:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 01:31:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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) [2022-01-31 01:31:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-01-31 01:31:31,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 31 [2022-01-31 01:31:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:31,898 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-01-31 01:31:31,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 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) [2022-01-31 01:31:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-01-31 01:31:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 01:31:31,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:31,899 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:31:31,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:32,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:32,119 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:32,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash 656866023, now seen corresponding path program 5 times [2022-01-31 01:31:32,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:32,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043498651] [2022-01-31 01:31:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:32,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:32,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:32,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043498651] [2022-01-31 01:31:32,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043498651] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:32,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347063742] [2022-01-31 01:31:32,192 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:31:32,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:32,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:32,193 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) [2022-01-31 01:31:32,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 01:31:32,243 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 01:31:32,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:32,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:31:32,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:32,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:32,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347063742] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:32,402 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:32,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:31:32,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955195443] [2022-01-31 01:31:32,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:32,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:31:32,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:32,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:31:32,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:31:32,404 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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) [2022-01-31 01:31:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:32,591 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-01-31 01:31:32,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:31:32,591 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 [2022-01-31 01:31:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:32,592 INFO L225 Difference]: With dead ends: 53 [2022-01-31 01:31:32,592 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 01:31:32,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 01:31:32,592 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:32,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 83 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:31:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 01:31:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-01-31 01:31:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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) [2022-01-31 01:31:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-01-31 01:31:32,596 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-01-31 01:31:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:32,597 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-01-31 01:31:32,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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) [2022-01-31 01:31:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-01-31 01:31:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:31:32,597 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:32,597 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:31:32,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:32,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:32,798 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash 641786569, now seen corresponding path program 6 times [2022-01-31 01:31:32,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:32,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834394387] [2022-01-31 01:31:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:32,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:32,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:32,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:32,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834394387] [2022-01-31 01:31:32,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834394387] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039338540] [2022-01-31 01:31:32,863 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:31:32,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:32,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:32,865 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) [2022-01-31 01:31:32,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 01:31:32,930 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 01:31:32,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:32,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:31:32,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:33,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:33,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039338540] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:33,108 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:33,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:31:33,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332345850] [2022-01-31 01:31:33,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:33,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:31:33,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:31:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:31:33,109 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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) [2022-01-31 01:31:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:33,234 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-01-31 01:31:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:31:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 [2022-01-31 01:31:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:33,235 INFO L225 Difference]: With dead ends: 57 [2022-01-31 01:31:33,235 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 01:31:33,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 01:31:33,236 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:33,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 41 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:31:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 01:31:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-01-31 01:31:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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) [2022-01-31 01:31:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-01-31 01:31:33,241 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2022-01-31 01:31:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:33,241 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-01-31 01:31:33,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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) [2022-01-31 01:31:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-01-31 01:31:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:31:33,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:33,241 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:31:33,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:33,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 01:31:33,451 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1793718585, now seen corresponding path program 7 times [2022-01-31 01:31:33,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:33,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950079320] [2022-01-31 01:31:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:33,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:33,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:33,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950079320] [2022-01-31 01:31:33,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950079320] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:33,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180460444] [2022-01-31 01:31:33,888 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:31:33,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:33,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:33,900 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) [2022-01-31 01:31:33,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 01:31:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:33,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 01:31:33,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:33,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:31:33,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:31:33,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:34,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:34,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:34,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:31:34,243 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:34,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:31:34,357 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:34,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:31:34,497 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:34,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2022-01-31 01:31:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:34,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:38,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ c_main_~i~0 1) ~N~0) (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse5 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 3)) (not (= .cse1 3)) (= (* 3 ~N~0) (+ .cse1 .cse0 .cse2 .cse3)) (not (= 3 .cse3))))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:31:38,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse5 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 3)) (not (= .cse1 3)) (= (* 3 ~N~0) (+ .cse1 .cse0 .cse2 .cse3)) (not (= 3 .cse3)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 01:31:38,754 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse5 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 3)) (not (= .cse1 3)) (< (+ c_main_~i~0 3) ~N~0) (not (< (+ c_main_~i~0 2) ~N~0)) (= (* 3 ~N~0) (+ .cse1 .cse0 .cse2 .cse3)) (not (= 3 .cse3))))))))) is different from false [2022-01-31 01:31:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-31 01:31:38,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180460444] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:38,906 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:38,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 42 [2022-01-31 01:31:38,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946880746] [2022-01-31 01:31:38,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:38,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 01:31:38,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:38,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 01:31:38,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1354, Unknown=5, NotChecked=228, Total=1722 [2022-01-31 01:31:38,908 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 42 states, 40 states have (on average 1.6) internal successors, (64), 39 states have internal predecessors, (64), 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) [2022-01-31 01:31:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:39,178 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-01-31 01:31:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:31:39,179 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 39 states have internal predecessors, (64), 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 36 [2022-01-31 01:31:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:39,179 INFO L225 Difference]: With dead ends: 56 [2022-01-31 01:31:39,179 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 01:31:39,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=181, Invalid=1718, Unknown=5, NotChecked=258, Total=2162 [2022-01-31 01:31:39,180 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:39,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 223 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 259 Invalid, 0 Unknown, 279 Unchecked, 0.1s Time] [2022-01-31 01:31:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 01:31:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-01-31 01:31:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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) [2022-01-31 01:31:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-31 01:31:39,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-01-31 01:31:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:39,186 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-31 01:31:39,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.6) internal successors, (64), 39 states have internal predecessors, (64), 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) [2022-01-31 01:31:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-31 01:31:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:31:39,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:39,187 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:31:39,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:39,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:39,403 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1691902085, now seen corresponding path program 2 times [2022-01-31 01:31:39,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:39,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249992100] [2022-01-31 01:31:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:39,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:39,412 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:31:39,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061679394] [2022-01-31 01:31:39,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:31:39,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:39,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:39,413 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) [2022-01-31 01:31:39,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 01:31:39,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:31:39,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:39,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 01:31:39,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:39,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:31:39,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:39,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:31:39,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:39,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:31:39,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:31:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:39,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:39,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:31:39,750 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 3)) is different from false [2022-01-31 01:31:39,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) is different from false [2022-01-31 01:31:39,767 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:31:39,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:31:39,772 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:31:39,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:31:39,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:31:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-31 01:31:39,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:39,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249992100] [2022-01-31 01:31:39,848 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:31:39,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061679394] [2022-01-31 01:31:39,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061679394] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:39,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:31:39,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-01-31 01:31:39,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740138050] [2022-01-31 01:31:39,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:39,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 01:31:39,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:39,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 01:31:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-01-31 01:31:39,849 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 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) [2022-01-31 01:31:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:40,026 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-01-31 01:31:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:31:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 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 36 [2022-01-31 01:31:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:40,027 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:31:40,027 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 01:31:40,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=349, Unknown=3, NotChecked=120, Total=552 [2022-01-31 01:31:40,028 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:40,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 218 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 191 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2022-01-31 01:31:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 01:31:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-01-31 01:31:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 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) [2022-01-31 01:31:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-01-31 01:31:40,033 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 36 [2022-01-31 01:31:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:40,033 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-01-31 01:31:40,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 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) [2022-01-31 01:31:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-01-31 01:31:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 01:31:40,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:40,034 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:31:40,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:40,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 01:31:40,251 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1556995259, now seen corresponding path program 8 times [2022-01-31 01:31:40,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:40,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620445920] [2022-01-31 01:31:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:40,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:40,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:40,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:40,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620445920] [2022-01-31 01:31:40,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620445920] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:40,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819041756] [2022-01-31 01:31:40,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:31:40,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:40,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:40,366 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) [2022-01-31 01:31:40,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 01:31:40,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:31:40,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:40,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:31:40,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:40,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:40,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819041756] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:40,605 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:40,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:31:40,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501887101] [2022-01-31 01:31:40,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:40,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:31:40,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:31:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:31:40,606 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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) [2022-01-31 01:31:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:40,817 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-01-31 01:31:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:31:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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 38 [2022-01-31 01:31:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:40,818 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:31:40,818 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 01:31:40,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:31:40,819 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:40,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 64 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:31:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 01:31:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-01-31 01:31:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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) [2022-01-31 01:31:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-01-31 01:31:40,825 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2022-01-31 01:31:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:40,826 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-01-31 01:31:40,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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) [2022-01-31 01:31:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-01-31 01:31:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:31:40,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:40,827 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:31:40,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:41,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 01:31:41,036 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1305678105, now seen corresponding path program 9 times [2022-01-31 01:31:41,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:41,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019491778] [2022-01-31 01:31:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:41,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:41,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:41,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:41,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019491778] [2022-01-31 01:31:41,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019491778] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:41,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729804120] [2022-01-31 01:31:41,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:31:41,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:41,148 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) [2022-01-31 01:31:41,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 01:31:41,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:31:41,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:41,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:31:41,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:41,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:41,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729804120] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:31:41,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:31:41,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:31:41,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031954076] [2022-01-31 01:31:41,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:31:41,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:31:41,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:31:41,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:31:41,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:31:41,420 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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) [2022-01-31 01:31:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:31:41,556 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-01-31 01:31:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:31:41,557 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 39 [2022-01-31 01:31:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:31:41,557 INFO L225 Difference]: With dead ends: 65 [2022-01-31 01:31:41,557 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 01:31:41,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 01:31:41,558 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:31:41,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:31:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 01:31:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-31 01:31:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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) [2022-01-31 01:31:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-01-31 01:31:41,562 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2022-01-31 01:31:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:31:41,562 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-01-31 01:31:41,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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) [2022-01-31 01:31:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-01-31 01:31:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:31:41,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:31:41,563 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:31:41,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 01:31:41,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 01:31:41,768 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:31:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:31:41,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1417373271, now seen corresponding path program 10 times [2022-01-31 01:31:41,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:31:41,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634731819] [2022-01-31 01:31:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:31:41,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:31:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:42,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:31:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:31:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:31:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:42,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:31:42,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634731819] [2022-01-31 01:31:42,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634731819] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:31:42,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826588612] [2022-01-31 01:31:42,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:31:42,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:31:42,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:31:42,422 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) [2022-01-31 01:31:42,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 01:31:42,482 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:31:42,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:31:42,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-31 01:31:42,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:31:42,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:31:42,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:42,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:42,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:42,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:42,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:42,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:42,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:31:42,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:42,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:31:42,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:42,950 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:42,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:31:43,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:43,078 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:43,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:31:43,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:43,209 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:43,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:31:43,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:31:43,334 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:31:43,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2022-01-31 01:31:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:31:43,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:32:03,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ c_main_~i~0 1) ~N~0) (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (* 3 ~N~0)) (not (= .cse0 3)) (not (= 3 .cse4)) (not (= .cse1 3)) (not (= 3 .cse2)))))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:32:04,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (~N~0 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (* 3 ~N~0)) (not (= .cse0 3)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= 3 .cse4)) (not (= .cse1 3)) (not (= 3 .cse2)) (< (+ c_main_~i~0 2) ~N~0))))))))) is different from false [2022-01-31 01:32:04,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (~N~0 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (< (+ c_main_~i~0 3) ~N~0) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (* 3 ~N~0)) (not (= .cse0 3)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 3 .cse4)) (not (= .cse1 3)) (not (= 3 .cse2)))))))))) is different from false [2022-01-31 01:32:05,657 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (~N~0 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (< (+ c_main_~i~0 4) ~N~0) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (* 3 ~N~0)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= .cse0 3)) (not (= 3 .cse4)) (not (= .cse1 3)) (not (= 3 .cse2)))))))))) is different from false [2022-01-31 01:32:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-01-31 01:32:06,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826588612] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:32:06,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:32:06,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 20] total 58 [2022-01-31 01:32:06,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553698153] [2022-01-31 01:32:06,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:32:06,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 01:32:06,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:32:06,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 01:32:06,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2655, Unknown=14, NotChecked=428, Total=3306 [2022-01-31 01:32:06,157 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 58 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 55 states have internal predecessors, (88), 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) [2022-01-31 01:32:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:32:06,866 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-01-31 01:32:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 01:32:06,866 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 55 states have internal predecessors, (88), 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 41 [2022-01-31 01:32:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:32:06,867 INFO L225 Difference]: With dead ends: 65 [2022-01-31 01:32:06,867 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 01:32:06,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=283, Invalid=3259, Unknown=14, NotChecked=476, Total=4032 [2022-01-31 01:32:06,868 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:32:06,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 212 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 481 Invalid, 0 Unknown, 534 Unchecked, 0.2s Time] [2022-01-31 01:32:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 01:32:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-01-31 01:32:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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) [2022-01-31 01:32:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-01-31 01:32:06,874 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 41 [2022-01-31 01:32:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:32:06,874 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-01-31 01:32:06,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 55 states have internal predecessors, (88), 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) [2022-01-31 01:32:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-01-31 01:32:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:32:06,876 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:32:06,876 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:32:06,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 01:32:07,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 01:32:07,077 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:32:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:32:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2068247399, now seen corresponding path program 3 times [2022-01-31 01:32:07,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:32:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688298226] [2022-01-31 01:32:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:32:07,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:32:07,086 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:32:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617156725] [2022-01-31 01:32:07,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:32:07,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:32:07,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:32:07,108 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) [2022-01-31 01:32:07,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 01:32:07,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:32:07,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:32:07,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-31 01:32:07,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:32:07,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 01:32:07,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:32:07,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:32:07,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:32:07,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:32:07,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:32:07,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:32:07,385 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:32:07,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 01:32:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 01:32:07,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:32:07,545 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (not (< main_~i~0 c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 3))) is different from false [2022-01-31 01:32:07,717 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:32:07,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-31 01:32:07,723 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-01-31 01:32:07,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-01-31 01:32:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2022-01-31 01:32:07,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:32:07,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688298226] [2022-01-31 01:32:07,758 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:32:07,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617156725] [2022-01-31 01:32:07,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617156725] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:32:07,759 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:32:07,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-01-31 01:32:07,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378022640] [2022-01-31 01:32:07,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:32:07,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 01:32:07,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:32:07,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 01:32:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=151, Unknown=6, NotChecked=26, Total=240 [2022-01-31 01:32:07,760 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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) [2022-01-31 01:32:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:32:07,858 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-01-31 01:32:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 01:32:07,859 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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 41 [2022-01-31 01:32:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:32:07,859 INFO L225 Difference]: With dead ends: 68 [2022-01-31 01:32:07,859 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 01:32:07,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=189, Unknown=6, NotChecked=30, Total=306 [2022-01-31 01:32:07,861 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:32:07,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 166 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 51 Unchecked, 0.0s Time] [2022-01-31 01:32:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 01:32:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-01-31 01:32:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 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) [2022-01-31 01:32:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-01-31 01:32:07,875 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 41 [2022-01-31 01:32:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:32:07,875 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-01-31 01:32:07,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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) [2022-01-31 01:32:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-01-31 01:32:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 01:32:07,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:32:07,877 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:32:07,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 01:32:08,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:32:08,094 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:32:08,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:32:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1382245397, now seen corresponding path program 11 times [2022-01-31 01:32:08,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:32:08,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640030513] [2022-01-31 01:32:08,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:32:08,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:32:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:32:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:32:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:32:08,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:32:08,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640030513] [2022-01-31 01:32:08,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640030513] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:32:08,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724908141] [2022-01-31 01:32:08,222 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:32:08,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:32:08,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:32:08,223 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) [2022-01-31 01:32:08,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 01:32:08,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 01:32:08,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:32:08,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:32:08,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:32:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:32:08,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:32:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:32:08,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724908141] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:32:08,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:32:08,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:32:08,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18609714] [2022-01-31 01:32:08,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:32:08,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:32:08,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:32:08,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:32:08,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:32:08,544 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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) [2022-01-31 01:32:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:32:08,844 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-01-31 01:32:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:32:08,844 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 43 [2022-01-31 01:32:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:32:08,845 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:32:08,845 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 01:32:08,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 01:32:08,846 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:32:08,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 77 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:32:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 01:32:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 50. [2022-01-31 01:32:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 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) [2022-01-31 01:32:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-01-31 01:32:08,852 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-01-31 01:32:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:32:08,852 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-01-31 01:32:08,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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) [2022-01-31 01:32:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-01-31 01:32:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 01:32:08,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:32:08,853 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:32:08,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 01:32:09,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 01:32:09,064 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:32:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:32:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash 532928709, now seen corresponding path program 12 times [2022-01-31 01:32:09,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:32:09,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774190809] [2022-01-31 01:32:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:32:09,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:32:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:32:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:32:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:32:09,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:32:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774190809] [2022-01-31 01:32:09,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774190809] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:32:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068977747] [2022-01-31 01:32:09,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:32:09,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:32:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:32:09,228 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) [2022-01-31 01:32:09,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 01:32:09,310 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 01:32:09,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:32:09,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:32:09,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:32:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:32:09,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:32:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:32:09,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068977747] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:32:09,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:32:09,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:32:09,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308384101] [2022-01-31 01:32:09,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:32:09,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:32:09,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:32:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:32:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:32:09,526 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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) [2022-01-31 01:32:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:32:09,685 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-01-31 01:32:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:32:09,685 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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 44 [2022-01-31 01:32:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:32:09,685 INFO L225 Difference]: With dead ends: 90 [2022-01-31 01:32:09,685 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 01:32:09,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:32:09,686 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:32:09,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 69 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:32:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 01:32:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-01-31 01:32:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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) [2022-01-31 01:32:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-01-31 01:32:09,692 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 44 [2022-01-31 01:32:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:32:09,692 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-01-31 01:32:09,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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) [2022-01-31 01:32:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-01-31 01:32:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:32:09,692 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:32:09,692 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:32:09,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 01:32:09,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 01:32:09,899 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:32:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:32:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash -944597181, now seen corresponding path program 13 times [2022-01-31 01:32:09,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:32:09,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151767838] [2022-01-31 01:32:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:32:09,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:32:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:10,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:32:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:10,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:32:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:32:10,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:32:10,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151767838] [2022-01-31 01:32:10,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151767838] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:32:10,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574537848] [2022-01-31 01:32:10,564 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:32:10,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:32:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:32:10,566 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) [2022-01-31 01:32:10,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 01:32:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:32:10,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-31 01:32:10,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:32:10,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:32:10,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:32:10,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:32:10,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:32:10,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:32:10,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:32:10,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:32:10,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:32:11,046 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:32:11,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2022-01-31 01:32:11,179 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:32:11,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:32:11,335 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:32:11,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:32:11,471 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:32:11,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:32:11,620 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:32:11,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 17 [2022-01-31 01:32:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:32:11,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:33:13,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_223 Int) (v_main_~i~0_221 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_219 Int) (v_main_~i~0_228 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_709 (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_221))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse5 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_219) main_~a~0.offset)))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (= (* 3 ~N~0) (+ .cse4 .cse1 .cse0 .cse5 .cse2 .cse3)) (not (= 3 .cse5))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:33:15,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_223 Int) (v_main_~i~0_221 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_219 Int) (v_main_~i~0_228 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_709 (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_221))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse5 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_219) main_~a~0.offset)))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (not (< (+ c_main_~i~0 1) ~N~0)) (= (* 3 ~N~0) (+ .cse4 .cse1 .cse0 .cse5 .cse2 .cse3)) (not (= 3 .cse5)) (< (+ c_main_~i~0 2) ~N~0)))))))))) is different from false [2022-01-31 01:33:18,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_223 Int) (v_main_~i~0_221 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_219 Int) (v_main_~i~0_228 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_709 (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_221))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse5 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_219) main_~a~0.offset)))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (< (+ c_main_~i~0 3) ~N~0) (not (= 3 .cse2)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 3 .cse3)) (= (* 3 ~N~0) (+ .cse4 .cse1 .cse0 .cse5 .cse2 .cse3)) (not (= 3 .cse5))))))))))) is different from false [2022-01-31 01:33:22,789 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_223 Int) (v_main_~i~0_221 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_219 Int) (v_main_~i~0_228 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_709 (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_221))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse5 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_219) main_~a~0.offset)))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= 3 .cse3)) (= (* 3 ~N~0) (+ .cse4 .cse1 .cse0 .cse5 .cse2 .cse3)) (not (= 3 .cse5))))))))))) is different from false [2022-01-31 01:33:27,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_223 Int) (v_main_~i~0_221 Int) (~N~0 Int) (main_~a~0.offset Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_219 Int) (v_main_~i~0_228 Int) (v_main_~i~0_225 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse7 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_709 (+ (* 4 v_main_~i~0_228) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_225))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_223))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_221))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse5 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_219) main_~a~0.offset)))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (< (+ c_main_~i~0 5) ~N~0) (not (= 3 .cse2)) (not (= 3 .cse3)) (not (< (+ c_main_~i~0 4) ~N~0)) (= (* 3 ~N~0) (+ .cse4 .cse1 .cse0 .cse5 .cse2 .cse3)) (not (= 3 .cse5))))))))))) is different from false [2022-01-31 01:33:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-01-31 01:33:29,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574537848] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:33:29,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:33:29,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 62 [2022-01-31 01:33:29,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489512263] [2022-01-31 01:33:29,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:33:29,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-31 01:33:29,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:33:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-31 01:33:29,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2969, Unknown=33, NotChecked=570, Total=3782 [2022-01-31 01:33:29,441 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 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) [2022-01-31 01:33:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:33:30,139 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-01-31 01:33:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 01:33:30,140 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 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 46 [2022-01-31 01:33:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:33:30,140 INFO L225 Difference]: With dead ends: 78 [2022-01-31 01:33:30,140 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 01:33:30,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 57.4s TimeCoverageRelationStatistics Valid=272, Invalid=3621, Unknown=33, NotChecked=630, Total=4556 [2022-01-31 01:33:30,141 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:33:30,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 238 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 512 Invalid, 0 Unknown, 574 Unchecked, 0.2s Time] [2022-01-31 01:33:30,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 01:33:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2022-01-31 01:33:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 59 states have internal predecessors, (67), 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) [2022-01-31 01:33:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-01-31 01:33:30,157 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 46 [2022-01-31 01:33:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:33:30,157 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-01-31 01:33:30,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 59 states have internal predecessors, (91), 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) [2022-01-31 01:33:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-01-31 01:33:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:33:30,158 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:33:30,158 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:33:30,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-31 01:33:30,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:33:30,360 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:33:30,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:33:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash -243532603, now seen corresponding path program 4 times [2022-01-31 01:33:30,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:33:30,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446662277] [2022-01-31 01:33:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:33:30,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:33:30,368 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:33:30,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [820555313] [2022-01-31 01:33:30,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:33:30,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:33:30,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:33:30,369 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) [2022-01-31 01:33:30,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-31 01:33:30,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:33:30,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:33:30,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-31 01:33:30,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:33:30,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 01:33:30,550 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:33:30,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:33:30,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:30,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:33:30,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:30,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:33:30,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:30,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:33:30,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:33:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 01:33:30,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:33:30,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:33:30,789 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 01:33:30,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 3)) is different from false [2022-01-31 01:33:30,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) is different from false [2022-01-31 01:33:30,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_776)) |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 3)) is different from false [2022-01-31 01:33:30,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_248 Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_248) c_main_~a~0.offset) v_ArrVal_776)) |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_248)))) is different from false [2022-01-31 01:33:30,859 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 01:33:30,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-01-31 01:33:30,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:33:30,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:33:30,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:33:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 31 not checked. [2022-01-31 01:33:30,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:33:30,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446662277] [2022-01-31 01:33:30,973 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:33:30,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820555313] [2022-01-31 01:33:30,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820555313] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:33:30,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:33:30,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 01:33:30,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363088386] [2022-01-31 01:33:30,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:33:30,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:33:30,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:33:30,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:33:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=364, Unknown=6, NotChecked=258, Total=702 [2022-01-31 01:33:30,974 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 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) [2022-01-31 01:33:33,068 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (forall ((v_main_~i~0_248 Int)) (or (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_248) c_main_~a~0.offset) v_ArrVal_776)) |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_248)))) (= c_main_~i~0 3) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|)) is different from false [2022-01-31 01:33:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:33:33,319 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-01-31 01:33:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:33:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 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 46 [2022-01-31 01:33:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:33:33,320 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:33:33,320 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 01:33:33,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=112, Invalid=611, Unknown=7, NotChecked=392, Total=1122 [2022-01-31 01:33:33,321 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:33:33,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 304 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 353 Invalid, 0 Unknown, 183 Unchecked, 0.2s Time] [2022-01-31 01:33:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 01:33:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-01-31 01:33:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 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) [2022-01-31 01:33:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-01-31 01:33:33,333 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 46 [2022-01-31 01:33:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:33:33,333 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-01-31 01:33:33,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 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) [2022-01-31 01:33:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-01-31 01:33:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 01:33:33,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:33:33,334 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:33:33,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-01-31 01:33:33,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:33:33,539 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:33:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:33:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash 787197505, now seen corresponding path program 14 times [2022-01-31 01:33:33,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:33:33,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727677698] [2022-01-31 01:33:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:33:33,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:33:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:33:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:33,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:33:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:33:33,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:33:33,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727677698] [2022-01-31 01:33:33,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727677698] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:33:33,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788215901] [2022-01-31 01:33:33,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:33:33,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:33:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:33:33,712 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) [2022-01-31 01:33:33,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-31 01:33:33,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:33:33,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:33:33,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 01:33:33,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:33:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:33:33,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:33:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:33:34,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788215901] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:33:34,084 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:33:34,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 01:33:34,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107014990] [2022-01-31 01:33:34,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:33:34,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:33:34,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:33:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:33:34,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:33:34,085 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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) [2022-01-31 01:33:34,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:33:34,489 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-01-31 01:33:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 01:33:34,489 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 48 [2022-01-31 01:33:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:33:34,490 INFO L225 Difference]: With dead ends: 89 [2022-01-31 01:33:34,490 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 01:33:34,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 01:33:34,490 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:33:34,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 73 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:33:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 01:33:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2022-01-31 01:33:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 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) [2022-01-31 01:33:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-01-31 01:33:34,497 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 48 [2022-01-31 01:33:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:33:34,497 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-01-31 01:33:34,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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) [2022-01-31 01:33:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-01-31 01:33:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 01:33:34,498 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:33:34,498 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:33:34,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 01:33:34,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:33:34,714 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:33:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:33:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1807662315, now seen corresponding path program 15 times [2022-01-31 01:33:34,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:33:34,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193473400] [2022-01-31 01:33:34,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:33:34,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:33:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:34,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:33:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:33:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:33:34,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:33:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193473400] [2022-01-31 01:33:34,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193473400] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:33:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779667564] [2022-01-31 01:33:34,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:33:34,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:33:34,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:33:34,848 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) [2022-01-31 01:33:34,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-31 01:33:34,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 01:33:34,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:33:34,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 01:33:34,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:33:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:33:35,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:33:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:33:35,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779667564] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:33:35,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:33:35,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 01:33:35,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077013045] [2022-01-31 01:33:35,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:33:35,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:33:35,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:33:35,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:33:35,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:33:35,237 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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) [2022-01-31 01:33:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:33:35,483 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-01-31 01:33:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:33:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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 [2022-01-31 01:33:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:33:35,484 INFO L225 Difference]: With dead ends: 98 [2022-01-31 01:33:35,484 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 01:33:35,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2022-01-31 01:33:35,485 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 71 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:33:35,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:33:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 01:33:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-01-31 01:33:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 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) [2022-01-31 01:33:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-01-31 01:33:35,492 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 49 [2022-01-31 01:33:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:33:35,493 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-01-31 01:33:35,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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) [2022-01-31 01:33:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-01-31 01:33:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:33:35,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:33:35,493 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:33:35,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-31 01:33:35,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-31 01:33:35,694 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:33:35,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:33:35,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1738973907, now seen corresponding path program 16 times [2022-01-31 01:33:35,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:33:35,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142233511] [2022-01-31 01:33:35,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:33:35,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:33:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:36,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:33:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:36,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:33:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:33:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:33:36,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:33:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142233511] [2022-01-31 01:33:36,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142233511] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:33:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609950277] [2022-01-31 01:33:36,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:33:36,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:33:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:33:36,576 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) [2022-01-31 01:33:36,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-31 01:33:36,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:33:36,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:33:36,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-31 01:33:36,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:33:36,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:33:36,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:36,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:33:36,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:36,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:33:36,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:36,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:33:36,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:36,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:33:36,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:36,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:33:37,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:37,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:33:37,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:37,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:33:37,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:37,451 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:33:37,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-01-31 01:33:37,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:37,656 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:33:37,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:33:37,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:37,835 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:33:37,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:33:38,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:38,024 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:33:38,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:33:38,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:38,243 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:33:38,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:33:38,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:33:38,418 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:33:38,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 23 [2022-01-31 01:33:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:33:38,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:35:33,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ c_main_~i~0 1) ~N~0) (forall ((v_main_~i~0_323 Int) (v_main_~i~0_312 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (main_~a~0.offset Int) (v_main_~i~0_318 Int) (v_main_~i~0_316 Int) (v_main_~i~0_314 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse8 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_323))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_318) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_316))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_314))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_312))))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= .cse2 3)) (not (= 3 .cse3)) (not (= 3 .cse4)) (= (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse0 .cse3) (* 3 ~N~0)) (not (= .cse6 3)))))))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:35:41,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_323 Int) (v_main_~i~0_312 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_318 Int) (v_main_~i~0_316 Int) (v_main_~i~0_314 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse8 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_323))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_318) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_316))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_314))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_312))))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= .cse2 3)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= 3 .cse3)) (not (= 3 .cse4)) (= (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse0 .cse3) (* 3 ~N~0)) (< (+ c_main_~i~0 2) ~N~0) (not (= .cse6 3)))))))))))) is different from false [2022-01-31 01:36:00,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_323 Int) (v_main_~i~0_312 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_318 Int) (v_main_~i~0_316 Int) (v_main_~i~0_314 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse8 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_323))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_318) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_316))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_314))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_312))))) (or (< (+ c_main_~i~0 3) ~N~0) (not (= 3 .cse0)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 3 .cse1)) (not (= .cse2 3)) (not (= 3 .cse3)) (not (= 3 .cse4)) (= (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse0 .cse3) (* 3 ~N~0)) (not (= .cse6 3)))))))))))) is different from false [2022-01-31 01:36:24,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_323 Int) (v_main_~i~0_312 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_318 Int) (v_main_~i~0_316 Int) (v_main_~i~0_314 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse8 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_323))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_318) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_316))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_314))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_312))))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= 3 .cse0)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= 3 .cse1)) (not (= .cse2 3)) (not (= 3 .cse3)) (not (= 3 .cse4)) (= (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse0 .cse3) (* 3 ~N~0)) (not (= .cse6 3)))))))))))) is different from false [2022-01-31 01:36:46,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_323 Int) (v_main_~i~0_312 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_318 Int) (v_main_~i~0_316 Int) (v_main_~i~0_314 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse8 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_323))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_318) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_316))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_314))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_312))))) (or (< (+ c_main_~i~0 5) ~N~0) (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= .cse2 3)) (not (< (+ c_main_~i~0 4) ~N~0)) (not (= 3 .cse3)) (not (= 3 .cse4)) (= (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse0 .cse3) (* 3 ~N~0)) (not (= .cse6 3)))))))))))) is different from false [2022-01-31 01:37:09,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_323 Int) (v_main_~i~0_312 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_318 Int) (v_main_~i~0_316 Int) (v_main_~i~0_314 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse8 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_323))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_318) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_316))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_314))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_312))))) (or (< (+ c_main_~i~0 6) ~N~0) (not (= 3 .cse0)) (not (= 3 .cse1)) (not (< (+ c_main_~i~0 5) ~N~0)) (not (= .cse2 3)) (not (= 3 .cse3)) (not (= 3 .cse4)) (= (+ .cse5 .cse2 .cse6 .cse1 .cse4 .cse0 .cse3) (* 3 ~N~0)) (not (= .cse6 3)))))))))))) is different from false [2022-01-31 01:37:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-01-31 01:37:22,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609950277] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:22,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:22,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 26, 26] total 77 [2022-01-31 01:37:22,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729329466] [2022-01-31 01:37:22,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:22,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-01-31 01:37:22,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-01-31 01:37:22,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4684, Unknown=49, NotChecked=858, Total=5852 [2022-01-31 01:37:22,891 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 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) [2022-01-31 01:37:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:30,067 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-01-31 01:37:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 01:37:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 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 51 [2022-01-31 01:37:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:30,068 INFO L225 Difference]: With dead ends: 87 [2022-01-31 01:37:30,068 INFO L226 Difference]: Without dead ends: 81 [2022-01-31 01:37:30,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 95.1s TimeCoverageRelationStatistics Valid=316, Invalid=5359, Unknown=49, NotChecked=918, Total=6642 [2022-01-31 01:37:30,070 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1009 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:30,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 386 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 709 Invalid, 0 Unknown, 1009 Unchecked, 0.4s Time] [2022-01-31 01:37:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-31 01:37:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-01-31 01:37:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 67 states have internal predecessors, (75), 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) [2022-01-31 01:37:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-01-31 01:37:30,085 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 51 [2022-01-31 01:37:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:30,088 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-01-31 01:37:30,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 74 states have internal predecessors, (115), 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) [2022-01-31 01:37:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-01-31 01:37:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:37:30,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:30,090 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:37:30,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-01-31 01:37:30,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-31 01:37:30,295 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1037909329, now seen corresponding path program 5 times [2022-01-31 01:37:30,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:30,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681526438] [2022-01-31 01:37:30,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:30,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:30,304 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:37:30,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325666393] [2022-01-31 01:37:30,304 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:37:30,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:30,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:30,305 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) [2022-01-31 01:37:30,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-31 01:37:30,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-31 01:37:30,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:30,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-31 01:37:30,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:30,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:37:30,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 01:37:30,568 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:37:30,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:37:30,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:37:30,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:37:30,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:37:30,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:37:30,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:37:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 01:37:30,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:30,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1050) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:37:30,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1050) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 3)) is different from false [2022-01-31 01:37:30,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1050) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 3)) is different from false [2022-01-31 01:37:30,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1050) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)))) is different from false [2022-01-31 01:37:30,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1050) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 3)) is different from false [2022-01-31 01:37:30,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 Int) (v_ArrVal_1050 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1046)) |c_main_~#sum~0.base| v_ArrVal_1050) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 3)) is different from false [2022-01-31 01:37:30,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_347 Int)) (or (forall ((v_ArrVal_1046 Int) (v_ArrVal_1050 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_347)) v_ArrVal_1046)) |c_main_~#sum~0.base| v_ArrVal_1050) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_347)))) is different from false [2022-01-31 01:37:30,903 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 01:37:30,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-01-31 01:37:30,908 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:37:30,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:37:30,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:37:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 46 not checked. [2022-01-31 01:37:30,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:30,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681526438] [2022-01-31 01:37:30,979 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:37:30,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325666393] [2022-01-31 01:37:30,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325666393] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:30,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:37:30,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2022-01-31 01:37:30,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548114925] [2022-01-31 01:37:30,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:30,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 01:37:30,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:30,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 01:37:30,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=297, Unknown=7, NotChecked=280, Total=650 [2022-01-31 01:37:30,980 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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) [2022-01-31 01:37:33,097 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_347 Int)) (or (forall ((v_ArrVal_1046 Int) (v_ArrVal_1050 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_347)) v_ArrVal_1046)) |c_main_~#sum~0.base| v_ArrVal_1050) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 3)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_347)))) (= 3 (+ (- 1) c_main_~i~0)) (= 3 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) is different from false [2022-01-31 01:37:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:33,389 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-01-31 01:37:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 01:37:33,389 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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 51 [2022-01-31 01:37:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:33,390 INFO L225 Difference]: With dead ends: 89 [2022-01-31 01:37:33,390 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 01:37:33,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=104, Invalid=570, Unknown=8, NotChecked=440, Total=1122 [2022-01-31 01:37:33,391 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:33,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 300 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 393 Invalid, 0 Unknown, 241 Unchecked, 0.2s Time] [2022-01-31 01:37:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 01:37:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-01-31 01:37:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.1) internal successors, (77), 70 states have internal predecessors, (77), 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) [2022-01-31 01:37:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2022-01-31 01:37:33,401 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 51 [2022-01-31 01:37:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:33,401 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2022-01-31 01:37:33,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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) [2022-01-31 01:37:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2022-01-31 01:37:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 01:37:33,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:33,402 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:37:33,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-01-31 01:37:33,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:33,620 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:33,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash 147649775, now seen corresponding path program 17 times [2022-01-31 01:37:33,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:33,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244190670] [2022-01-31 01:37:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:33,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:33,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:33,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244190670] [2022-01-31 01:37:33,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244190670] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046534198] [2022-01-31 01:37:33,858 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:37:33,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:33,872 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) [2022-01-31 01:37:33,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-31 01:37:34,013 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-01-31 01:37:34,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:34,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-31 01:37:34,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:34,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:34,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046534198] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:34,415 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:34,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-01-31 01:37:34,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990561255] [2022-01-31 01:37:34,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:34,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:37:34,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:37:34,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:37:34,417 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 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) [2022-01-31 01:37:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:35,213 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-01-31 01:37:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 01:37:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 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 53 [2022-01-31 01:37:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:35,215 INFO L225 Difference]: With dead ends: 97 [2022-01-31 01:37:35,215 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 01:37:35,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 01:37:35,216 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:35,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 87 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 01:37:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 01:37:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 60. [2022-01-31 01:37:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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) [2022-01-31 01:37:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-01-31 01:37:35,224 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 53 [2022-01-31 01:37:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:35,224 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-01-31 01:37:35,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7777777777777777) internal successors, (75), 26 states have internal predecessors, (75), 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) [2022-01-31 01:37:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-01-31 01:37:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 01:37:35,225 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:35,225 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:37:35,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-31 01:37:35,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:35,438 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1800419009, now seen corresponding path program 18 times [2022-01-31 01:37:35,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:35,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914071736] [2022-01-31 01:37:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:35,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:35,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:35,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914071736] [2022-01-31 01:37:35,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914071736] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:35,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964920028] [2022-01-31 01:37:35,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:37:35,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:35,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:35,692 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) [2022-01-31 01:37:35,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-31 01:37:35,868 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-01-31 01:37:35,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:37:35,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-31 01:37:35,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:36,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:37:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:36,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964920028] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:37:36,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:37:36,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-01-31 01:37:36,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517803825] [2022-01-31 01:37:36,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:37:36,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:37:36,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:37:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:37:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:37:36,296 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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) [2022-01-31 01:37:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:37:36,639 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-01-31 01:37:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 01:37:36,639 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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 54 [2022-01-31 01:37:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:37:36,640 INFO L225 Difference]: With dead ends: 106 [2022-01-31 01:37:36,640 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 01:37:36,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 01:37:36,640 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 90 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:37:36,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 60 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:37:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 01:37:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2022-01-31 01:37:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 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) [2022-01-31 01:37:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-01-31 01:37:36,651 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 54 [2022-01-31 01:37:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:37:36,651 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-01-31 01:37:36,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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) [2022-01-31 01:37:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-01-31 01:37:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 01:37:36,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:37:36,652 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:37:36,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-31 01:37:36,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-31 01:37:36,870 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:37:36,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:37:36,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2030473281, now seen corresponding path program 19 times [2022-01-31 01:37:36,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:37:36,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695973944] [2022-01-31 01:37:36,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:37:36,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:37:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:38,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:37:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:37:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:38,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:37:38,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695973944] [2022-01-31 01:37:38,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695973944] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:37:38,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831387914] [2022-01-31 01:37:38,242 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:37:38,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:37:38,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:37:38,243 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) [2022-01-31 01:37:38,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-31 01:37:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:37:38,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 93 conjunts are in the unsatisfiable core [2022-01-31 01:37:38,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:37:38,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:37:38,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:37:38,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:37:38,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:37:38,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:37:38,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:37:38,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:37:38,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:37:38,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:37:38,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:37:38,862 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:38,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:37:39,087 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:39,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:37:39,365 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:37:39,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2022-01-31 01:37:39,572 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:39,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:37:39,799 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:37:39,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:37:40,069 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:37:40,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 65 [2022-01-31 01:37:40,345 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:37:40,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 20 [2022-01-31 01:37:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:37:40,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:42:36,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_432 Int) (v_main_~i~0_422 Int) (v_main_~i~0_430 Int) (main_~a~0.offset Int) (v_main_~i~0_428 Int) (v_ArrVal_1262 (Array Int Int)) (v_main_~i~0_426 Int) (v_main_~i~0_435 Int) (v_main_~i~0_424 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1262))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse9 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1262 (+ main_~a~0.offset (* 4 v_main_~i~0_435))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_432))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse5 .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_430))))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_428))))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_426))))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse6 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_424) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_422) main_~a~0.offset)))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= .cse2 3)) (not (= .cse3 3)) (not (= .cse4 3)) (= (* 3 ~N~0) (+ .cse3 .cse4 .cse5 .cse2 .cse6 .cse0 .cse7 .cse1)) (not (= 3 .cse6)) (not (= 3 .cse7))))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:43:21,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_432 Int) (v_main_~i~0_422 Int) (v_main_~i~0_430 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_428 Int) (v_ArrVal_1262 (Array Int Int)) (v_main_~i~0_426 Int) (v_main_~i~0_435 Int) (v_main_~i~0_424 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1262))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse9 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1262 (+ main_~a~0.offset (* 4 v_main_~i~0_435))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_432))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse5 .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_430))))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_428))))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_426))))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse6 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_424) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_422) main_~a~0.offset)))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= .cse2 3)) (not (= .cse3 3)) (not (= .cse4 3)) (not (< (+ c_main_~i~0 1) ~N~0)) (= (* 3 ~N~0) (+ .cse3 .cse4 .cse5 .cse2 .cse6 .cse0 .cse7 .cse1)) (not (= 3 .cse6)) (not (= 3 .cse7)) (< (+ c_main_~i~0 2) ~N~0)))))))))))) is different from false [2022-01-31 01:45:29,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_432 Int) (v_main_~i~0_422 Int) (v_main_~i~0_430 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_428 Int) (v_ArrVal_1262 (Array Int Int)) (v_main_~i~0_426 Int) (v_main_~i~0_435 Int) (v_main_~i~0_424 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1262))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse9 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_1262 (+ main_~a~0.offset (* 4 v_main_~i~0_435))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse5 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_432))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse5 .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_430))))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_428))))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_426))))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse5 .cse6 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_424) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse0 .cse7 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_422) main_~a~0.offset)))) (or (not (= 3 .cse0)) (not (= 3 .cse1)) (not (= .cse2 3)) (< (+ c_main_~i~0 3) ~N~0) (not (= .cse3 3)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse4 3)) (= (* 3 ~N~0) (+ .cse3 .cse4 .cse5 .cse2 .cse6 .cse0 .cse7 .cse1)) (not (= 3 .cse6)) (not (= 3 .cse7))))))))))))) is different from false