/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-fpi/s32if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:41:00,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:41:00,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:41:01,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:41:01,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:41:01,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:41:01,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:41:01,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:41:01,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:41:01,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:41:01,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:41:01,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:41:01,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:41:01,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:41:01,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:41:01,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:41:01,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:41:01,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:41:01,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:41:01,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:41:01,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:41:01,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:41:01,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:41:01,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:41:01,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:41:01,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:41:01,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:41:01,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:41:01,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:41:01,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:41:01,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:41:01,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:41:01,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:41:01,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:41:01,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:41:01,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:41:01,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:41:01,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:41:01,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:41:01,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:41:01,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:41:01,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:41:01,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:41:01,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:41:01,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:41:01,047 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:41:01,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:41:01,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:41:01,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:41:01,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:41:01,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:41:01,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:41:01,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:41:01,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:41:01,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:41:01,049 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:41:01,049 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 11:41:01,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:41:01,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:41:01,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:41:01,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:41:01,294 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:41:01,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s32if.c [2022-01-31 11:41:01,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cafe0d614/df3e917c34984a7daeb7434ca739085c/FLAG6e6a04f18 [2022-01-31 11:41:01,670 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:41:01,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s32if.c [2022-01-31 11:41:01,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cafe0d614/df3e917c34984a7daeb7434ca739085c/FLAG6e6a04f18 [2022-01-31 11:41:02,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cafe0d614/df3e917c34984a7daeb7434ca739085c [2022-01-31 11:41:02,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:41:02,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:41:02,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:41:02,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:41:02,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:41:02,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2481e69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02, skipping insertion in model container [2022-01-31 11:41:02,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:41:02,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:41:02,250 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/s32if.c[588,601] [2022-01-31 11:41:02,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:41:02,301 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:41:02,311 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/s32if.c[588,601] [2022-01-31 11:41:02,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:41:02,342 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:41:02,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02 WrapperNode [2022-01-31 11:41:02,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:41:02,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:41:02,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:41:02,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:41:02,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:41:02,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:41:02,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:41:02,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:41:02,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:41:02,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:02,459 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 11:41:02,461 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 11:41:02,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:41:02,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:41:02,498 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:41:02,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:41:02,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:41:02,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:41:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:41:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:41:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:41:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:41:02,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:41:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:41:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:41:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:41:02,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:41:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:41:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:41:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:41:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:41:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:41:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:41:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:41:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:41:02,555 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:41:02,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:41:02,653 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:41:02,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:41:02,657 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:41:02,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:41:02 BoogieIcfgContainer [2022-01-31 11:41:02,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:41:02,658 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:41:02,658 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:41:02,659 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:41:02,661 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:41:02" (1/1) ... [2022-01-31 11:41:02,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:41:02 BasicIcfg [2022-01-31 11:41:02,674 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:41:02,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:41:02,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:41:02,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:41:02,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:41:02" (1/4) ... [2022-01-31 11:41:02,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d267ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:41:02, skipping insertion in model container [2022-01-31 11:41:02,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:41:02" (2/4) ... [2022-01-31 11:41:02,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d267ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:41:02, skipping insertion in model container [2022-01-31 11:41:02,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:41:02" (3/4) ... [2022-01-31 11:41:02,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d267ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:41:02, skipping insertion in model container [2022-01-31 11:41:02,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:41:02" (4/4) ... [2022-01-31 11:41:02,679 INFO L111 eAbstractionObserver]: Analyzing ICFG s32if.cJordan [2022-01-31 11:41:02,682 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:41:02,682 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:41:02,707 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:41:02,711 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 11:41:02,711 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:41:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:41:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:41:02,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:02,724 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] [2022-01-31 11:41:02,724 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:02,728 INFO L85 PathProgramCache]: Analyzing trace with hash 891722992, now seen corresponding path program 1 times [2022-01-31 11:41:02,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:02,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308941127] [2022-01-31 11:41:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:02,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:02,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:02,892 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 11:41:02,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:02,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308941127] [2022-01-31 11:41:02,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308941127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:41:02,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:41:02,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:41:02,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415125332] [2022-01-31 11:41:02,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:41:02,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:41:02,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:02,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:41:02,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:41:02,919 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:02,970 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-01-31 11:41:02,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:41:02,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-01-31 11:41:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:02,976 INFO L225 Difference]: With dead ends: 36 [2022-01-31 11:41:02,976 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 11:41:02,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 11:41:02,980 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:02,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:41:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 11:41:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 11:41:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:41:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-31 11:41:03,004 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2022-01-31 11:41:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:03,004 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-31 11:41:03,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-31 11:41:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:41:03,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:03,005 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] [2022-01-31 11:41:03,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:41:03,006 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:03,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1828318323, now seen corresponding path program 1 times [2022-01-31 11:41:03,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:03,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650001646] [2022-01-31 11:41:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:03,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:03,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:03,084 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 11:41:03,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:03,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650001646] [2022-01-31 11:41:03,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650001646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:41:03,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:41:03,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:41:03,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267938080] [2022-01-31 11:41:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:41:03,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:41:03,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:03,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:41:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:41:03,087 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:41:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:03,169 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-01-31 11:41:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:41:03,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-01-31 11:41:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:03,171 INFO L225 Difference]: With dead ends: 37 [2022-01-31 11:41:03,171 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 11:41:03,176 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 11:41:03,177 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:03,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:41:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 11:41:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-01-31 11:41:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:41:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 11:41:03,186 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-01-31 11:41:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:03,186 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 11:41:03,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:41:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 11:41:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:41:03,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:03,187 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, 1, 1, 1, 1, 1] [2022-01-31 11:41:03,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:41:03,187 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash -343654416, now seen corresponding path program 1 times [2022-01-31 11:41:03,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:03,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101440818] [2022-01-31 11:41:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:03,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:03,207 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:03,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409709683] [2022-01-31 11:41:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:03,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:03,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:03,209 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 11:41:03,251 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 11:41:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:03,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:41:03,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:03,435 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 11:41:03,501 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 17 treesize of output 9 [2022-01-31 11:41:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:03,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:03,586 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 37 treesize of output 31 [2022-01-31 11:41:03,593 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:41:03,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2022-01-31 11:41:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:03,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:03,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101440818] [2022-01-31 11:41:03,635 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:03,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409709683] [2022-01-31 11:41:03,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409709683] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:03,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:03,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-01-31 11:41:03,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341554494] [2022-01-31 11:41:03,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:03,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:41:03,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:41:03,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:41:03,640 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:03,750 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-01-31 11:41:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 11:41:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 11:41:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:03,752 INFO L225 Difference]: With dead ends: 46 [2022-01-31 11:41:03,752 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 11:41:03,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:41:03,753 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:03,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:41:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 11:41:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-01-31 11:41:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 11:41:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-01-31 11:41:03,756 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 31 [2022-01-31 11:41:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:03,757 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-01-31 11:41:03,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-01-31 11:41:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:41:03,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:03,758 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, 1, 1, 1, 1, 1] [2022-01-31 11:41:03,787 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 11:41:03,971 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 11:41:03,972 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:03,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:03,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2086464751, now seen corresponding path program 1 times [2022-01-31 11:41:03,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:03,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524641212] [2022-01-31 11:41:03,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:03,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:04,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:04,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524641212] [2022-01-31 11:41:04,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524641212] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:04,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042995018] [2022-01-31 11:41:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:04,224 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:04,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:04,225 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 11:41:04,262 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 11:41:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:04,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:41:04,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:04,304 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 11:41:04,310 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 11:41:04,336 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 11:41:04,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:41:04,458 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 11:41:04,530 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 34 treesize of output 10 [2022-01-31 11:41:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:04,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:04,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_74 (Array Int Int)) (main_~i~0 Int) (main_~a~0.offset Int)) (let ((.cse0 (select v_ArrVal_74 (+ main_~a~0.offset (* main_~i~0 4))))) (or (not (= .cse0 4)) (= (* c_~N~0 4) (+ .cse0 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_74) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) is different from false [2022-01-31 11:41:04,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:04,775 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 11:41:04,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:41:04,794 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 11:41:04,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-31 11:41:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 11:41:04,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042995018] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:04,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:41:04,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 25 [2022-01-31 11:41:04,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533088911] [2022-01-31 11:41:04,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:04,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 11:41:04,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 11:41:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2022-01-31 11:41:04,824 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 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 11:41:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:05,126 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-01-31 11:41:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 11:41:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 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 31 [2022-01-31 11:41:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:05,128 INFO L225 Difference]: With dead ends: 55 [2022-01-31 11:41:05,128 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 11:41:05,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=878, Unknown=1, NotChecked=62, Total=1122 [2022-01-31 11:41:05,129 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:05,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 131 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 221 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2022-01-31 11:41:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 11:41:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-01-31 11:41:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 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 11:41:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-01-31 11:41:05,135 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 31 [2022-01-31 11:41:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:05,135 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-01-31 11:41:05,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 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 11:41:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-01-31 11:41:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:41:05,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:05,136 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, 1, 1, 1, 1, 1] [2022-01-31 11:41:05,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 11:41:05,352 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 11:41:05,353 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:05,353 INFO L85 PathProgramCache]: Analyzing trace with hash -637057423, now seen corresponding path program 1 times [2022-01-31 11:41:05,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:05,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66191094] [2022-01-31 11:41:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:05,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:05,364 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:05,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651608773] [2022-01-31 11:41:05,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:05,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:05,379 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 11:41:05,403 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 11:41:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:05,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 11:41:05,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:05,464 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 11:41:05,511 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 11:41:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:05,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:05,563 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 11:41:05,565 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 11:41:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:05,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:05,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66191094] [2022-01-31 11:41:05,591 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:05,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651608773] [2022-01-31 11:41:05,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651608773] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:05,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:05,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 11:41:05,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786214686] [2022-01-31 11:41:05,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:05,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:41:05,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:05,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:41:05,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:41:05,592 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:05,654 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-01-31 11:41:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 11:41:05,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 11:41:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:05,655 INFO L225 Difference]: With dead ends: 56 [2022-01-31 11:41:05,655 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 11:41:05,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 11:41:05,656 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:05,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:41:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 11:41:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-01-31 11:41:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 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 11:41:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-01-31 11:41:05,667 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 31 [2022-01-31 11:41:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:05,668 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-01-31 11:41:05,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-01-31 11:41:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 11:41:05,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:05,670 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, 1, 1, 1, 1, 1] [2022-01-31 11:41:05,688 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 11:41:05,884 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 11:41:05,885 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:05,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:05,885 INFO L85 PathProgramCache]: Analyzing trace with hash -531940331, now seen corresponding path program 2 times [2022-01-31 11:41:05,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:05,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030525975] [2022-01-31 11:41:05,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:05,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:05,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:05,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:05,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030525975] [2022-01-31 11:41:05,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030525975] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:05,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179770603] [2022-01-31 11:41:05,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:41:05,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:05,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:05,989 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 11:41:05,989 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 11:41:06,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:41:06,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:06,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:41:06,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:06,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:06,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179770603] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:06,208 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:41:06,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:41:06,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523695044] [2022-01-31 11:41:06,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:06,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:41:06,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:41:06,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:41:06,209 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:06,426 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-01-31 11:41:06,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:41:06,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-01-31 11:41:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:06,427 INFO L225 Difference]: With dead ends: 69 [2022-01-31 11:41:06,427 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 11:41:06,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 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 11:41:06,428 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 56 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:06,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 66 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:41:06,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 11:41:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2022-01-31 11:41:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 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 11:41:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-01-31 11:41:06,431 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 33 [2022-01-31 11:41:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:06,431 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-01-31 11:41:06,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-01-31 11:41:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:41:06,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:06,432 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, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:06,465 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 11:41:06,648 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 11:41:06,649 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1196805917, now seen corresponding path program 1 times [2022-01-31 11:41:06,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:06,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768920925] [2022-01-31 11:41:06,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:06,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:06,658 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:06,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587789455] [2022-01-31 11:41:06,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:06,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:06,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:06,671 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 11:41:06,689 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 11:41:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:06,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:41:06,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:06,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 11:41:06,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:06,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768920925] [2022-01-31 11:41:06,852 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:06,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587789455] [2022-01-31 11:41:06,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587789455] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:06,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:06,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 11:41:06,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115300207] [2022-01-31 11:41:06,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:06,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:41:06,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:41:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:41:06,854 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 11:41:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:06,931 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-01-31 11:41:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:41:06,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 34 [2022-01-31 11:41:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:06,932 INFO L225 Difference]: With dead ends: 62 [2022-01-31 11:41:06,932 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:41:06,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:41:06,933 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:06,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 71 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:41:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:41:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-01-31 11:41:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:41:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-01-31 11:41:06,935 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2022-01-31 11:41:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:06,935 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-01-31 11:41:06,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 11:41:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-01-31 11:41:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:41:06,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:06,936 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:06,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 11:41:07,147 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 11:41:07,148 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:07,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1165711052, now seen corresponding path program 2 times [2022-01-31 11:41:07,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:07,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857316315] [2022-01-31 11:41:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:07,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:07,159 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:07,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222432350] [2022-01-31 11:41:07,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:41:07,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:07,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:07,160 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 11:41:07,167 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 11:41:07,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:41:07,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:07,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 11:41:07,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:07,299 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:41:07,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:07,339 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 11:41:07,363 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:07,363 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 11:41:07,405 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 11:41:07,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:07,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_main_~i~0_63 Int)) (or (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_205) c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 4))) 4) (< (+ v_main_~i~0_63 1) c_~N~0) (not (<= v_main_~i~0_63 (+ c_main_~i~0 1))))) is different from false [2022-01-31 11:41:07,562 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:07,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-01-31 11:41:07,566 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:07,566 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 44 treesize of output 44 [2022-01-31 11:41:07,569 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 13 treesize of output 7 [2022-01-31 11:41:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-31 11:41:07,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:07,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857316315] [2022-01-31 11:41:07,778 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:07,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222432350] [2022-01-31 11:41:07,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222432350] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:07,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:07,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-01-31 11:41:07,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479779474] [2022-01-31 11:41:07,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:07,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:41:07,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:07,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:41:07,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=562, Unknown=7, NotChecked=50, Total=756 [2022-01-31 11:41:07,780 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 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 11:41:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:08,085 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-01-31 11:41:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:41:08,086 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 11:41:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:08,087 INFO L225 Difference]: With dead ends: 65 [2022-01-31 11:41:08,087 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 11:41:08,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=922, Unknown=8, NotChecked=66, Total=1260 [2022-01-31 11:41:08,088 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 149 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:08,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 191 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 231 Invalid, 0 Unknown, 164 Unchecked, 0.1s Time] [2022-01-31 11:41:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 11:41:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-01-31 11:41:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 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 11:41:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-01-31 11:41:08,091 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2022-01-31 11:41:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:08,091 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-01-31 11:41:08,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 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 11:41:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-01-31 11:41:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:41:08,092 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:08,092 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:08,125 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 11:41:08,308 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 11:41:08,308 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:08,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1386445909, now seen corresponding path program 3 times [2022-01-31 11:41:08,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:08,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455336362] [2022-01-31 11:41:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:08,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:08,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 11:41:08,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455336362] [2022-01-31 11:41:08,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455336362] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573005875] [2022-01-31 11:41:08,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:41:08,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:08,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:08,676 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 11:41:08,735 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 11:41:08,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:41:08,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:08,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:41:08,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:08,809 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 11:41:08,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:08,829 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 11:41:08,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:08,840 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 11:41:08,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:08,878 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 11:41:08,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:08,941 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 11:41:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:09,050 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 11:41:09,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:09,154 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:41:09,155 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 11:41:09,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:09,276 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:41:09,276 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 11:41:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:41:09,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:11,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_79 Int) (v_main_~i~0_76 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_249))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse4 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse1 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse2 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (and (<= (+ c_main_~i~0 1) (div (+ .cse2 .cse0 .cse1) 4)) (<= (div (+ (- 1) .cse2 .cse0 .cse1) 4) c_main_~i~0)))))))) is different from false [2022-01-31 11:41:12,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_79 Int) (v_main_~i~0_76 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_249))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse4 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (not (= .cse0 4)) (and (<= (div (+ (- 1) .cse1 .cse0 .cse2) 4) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ .cse1 .cse0 .cse2) 4))) (not (= .cse2 4)))))))) is different from false [2022-01-31 11:41:12,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_79 Int) (v_main_~i~0_76 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_249))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse4 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse0 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (and (<= 2 (div (+ .cse0 .cse1 .cse2) 4)) (<= (div (+ (- 1) .cse0 .cse1 .cse2) 4) 1)) (not (= .cse1 4)) (not (= .cse2 4)))))))) is different from false [2022-01-31 11:41:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-01-31 11:41:12,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573005875] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:12,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:41:12,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 42 [2022-01-31 11:41:12,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959789930] [2022-01-31 11:41:12,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:12,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 11:41:12,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:12,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 11:41:12,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1325, Unknown=6, NotChecked=228, Total=1722 [2022-01-31 11:41:12,735 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 42 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:13,750 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2022-01-31 11:41:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 11:41:13,751 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 11:41:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:13,751 INFO L225 Difference]: With dead ends: 107 [2022-01-31 11:41:13,751 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 11:41:13,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=313, Invalid=2243, Unknown=6, NotChecked=300, Total=2862 [2022-01-31 11:41:13,753 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 85 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:13,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 227 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 635 Invalid, 0 Unknown, 451 Unchecked, 0.3s Time] [2022-01-31 11:41:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 11:41:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2022-01-31 11:41:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 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 11:41:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-01-31 11:41:13,757 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 39 [2022-01-31 11:41:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:13,757 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-01-31 11:41:13,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.925) internal successors, (77), 39 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-01-31 11:41:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:41:13,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:13,758 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:13,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-31 11:41:13,971 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 11:41:13,971 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 821770708, now seen corresponding path program 1 times [2022-01-31 11:41:13,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843099099] [2022-01-31 11:41:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:13,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:13,980 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:13,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335411240] [2022-01-31 11:41:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:13,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:13,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:13,984 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 11:41:13,985 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 11:41:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:14,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-31 11:41:14,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:14,073 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 11:41:14,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:14,116 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 25 treesize of output 24 [2022-01-31 11:41:14,137 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 11:41:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:41:14,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:14,233 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 16 treesize of output 14 [2022-01-31 11:41:14,234 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 28 treesize of output 24 [2022-01-31 11:41:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 11:41:14,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:14,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843099099] [2022-01-31 11:41:14,268 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:14,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335411240] [2022-01-31 11:41:14,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335411240] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:14,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:14,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-01-31 11:41:14,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079316946] [2022-01-31 11:41:14,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:14,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 11:41:14,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 11:41:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-01-31 11:41:14,271 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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 11:41:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:14,386 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2022-01-31 11:41:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 11:41:14,386 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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 39 [2022-01-31 11:41:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:14,387 INFO L225 Difference]: With dead ends: 84 [2022-01-31 11:41:14,387 INFO L226 Difference]: Without dead ends: 84 [2022-01-31 11:41:14,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-01-31 11:41:14,387 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:14,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 179 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:41:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-31 11:41:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-01-31 11:41:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 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 11:41:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2022-01-31 11:41:14,391 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 39 [2022-01-31 11:41:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:14,391 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2022-01-31 11:41:14,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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 11:41:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2022-01-31 11:41:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:41:14,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:14,392 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:14,413 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 11:41:14,603 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 11:41:14,603 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1211084633, now seen corresponding path program 3 times [2022-01-31 11:41:14,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:14,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277721463] [2022-01-31 11:41:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:14,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:14,613 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:14,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996639510] [2022-01-31 11:41:14,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:41:14,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:14,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:14,632 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 11:41:14,658 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 11:41:14,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 11:41:14,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:14,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:41:14,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:41:14,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 11:41:14,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:14,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277721463] [2022-01-31 11:41:14,853 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:14,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996639510] [2022-01-31 11:41:14,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996639510] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:14,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:14,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:41:14,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271897914] [2022-01-31 11:41:14,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:14,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:41:14,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:41:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:41:14,855 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:14,968 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-01-31 11:41:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:41:14,968 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 11:41:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:14,968 INFO L225 Difference]: With dead ends: 83 [2022-01-31 11:41:14,969 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 11:41:14,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-31 11:41:14,969 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:14,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 109 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:41:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 11:41:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-01-31 11:41:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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 11:41:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-01-31 11:41:14,972 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 42 [2022-01-31 11:41:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:14,972 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-01-31 11:41:14,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-01-31 11:41:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:41:14,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:14,972 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:14,996 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 11:41:15,183 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 11:41:15,184 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:15,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash -23692747, now seen corresponding path program 4 times [2022-01-31 11:41:15,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:15,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843053542] [2022-01-31 11:41:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:15,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:15,193 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:15,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453948042] [2022-01-31 11:41:15,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:41:15,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:15,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:15,195 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 11:41:15,196 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 11:41:15,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:41:15,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:15,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:41:15,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:15,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:15,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:15,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843053542] [2022-01-31 11:41:15,425 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:15,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453948042] [2022-01-31 11:41:15,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453948042] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:15,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:15,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:41:15,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242227575] [2022-01-31 11:41:15,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:15,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:41:15,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:15,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:41:15,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:41:15,426 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 11:41:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:15,541 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-01-31 11:41:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:41:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 44 [2022-01-31 11:41:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:15,542 INFO L225 Difference]: With dead ends: 59 [2022-01-31 11:41:15,542 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 11:41:15,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:41:15,542 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 105 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:15,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 74 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:41:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 11:41:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2022-01-31 11:41:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 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 11:41:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-01-31 11:41:15,546 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 44 [2022-01-31 11:41:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:15,546 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-01-31 11:41:15,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 11:41:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-01-31 11:41:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:41:15,547 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:15,547 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:15,565 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 11:41:15,747 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 11:41:15,747 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:15,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:15,748 INFO L85 PathProgramCache]: Analyzing trace with hash 845505913, now seen corresponding path program 5 times [2022-01-31 11:41:15,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:15,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637811440] [2022-01-31 11:41:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:15,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:15,757 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:15,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229997028] [2022-01-31 11:41:15,758 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:41:15,758 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:15,769 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 11:41:15,783 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 11:41:15,868 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:41:15,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:15,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:41:15,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:16,004 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:41:16,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:16,060 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 23 treesize of output 22 [2022-01-31 11:41:16,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:16,104 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 23 treesize of output 22 [2022-01-31 11:41:16,131 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 11:41:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:41:16,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:17,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.base| Int) (v_ArrVal_438 Int)) (= 4 (select (select (store |c_#memory_int| |main_~#sum~0.base| (store (select |c_#memory_int| |main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_438)) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:41:17,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.base| Int) (v_ArrVal_438 Int)) (= (select (select (store |c_#memory_int| |main_~#sum~0.base| (store (select |c_#memory_int| |main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_438)) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:41:18,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:18,897 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 222 treesize of output 200 [2022-01-31 11:41:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 9 not checked. [2022-01-31 11:41:19,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:19,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637811440] [2022-01-31 11:41:19,059 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:19,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229997028] [2022-01-31 11:41:19,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229997028] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:19,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:19,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-01-31 11:41:19,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183348251] [2022-01-31 11:41:19,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:19,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 11:41:19,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:19,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 11:41:19,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=384, Unknown=2, NotChecked=82, Total=552 [2022-01-31 11:41:19,061 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:21,126 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (and (= (+ .cse0 (- 3)) 1) (<= |c_main_~#sum~0.offset| 0) (<= 0 c_main_~a~0.offset) (= c_main_~i~0 2) (forall ((|main_~#sum~0.base| Int) (v_ArrVal_438 Int)) (= (select (select (store |c_#memory_int| |main_~#sum~0.base| (store (select |c_#memory_int| |main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_438)) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) (= .cse0 4) (= (+ c_main_~i~0 (- 2)) 0))) is different from false [2022-01-31 11:41:21,793 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (- 3)) 1) (<= |c_main_~#sum~0.offset| 0) (<= 0 c_main_~a~0.offset) (forall ((|main_~#sum~0.base| Int) (v_ArrVal_438 Int)) (= (select (select (store |c_#memory_int| |main_~#sum~0.base| (store (select |c_#memory_int| |main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_438)) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4))) is different from false [2022-01-31 11:41:22,625 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (- 3)) 1) (<= |c_main_~#sum~0.offset| 0) (<= 0 c_main_~a~0.offset) (= c_main_~i~0 0) (forall ((|main_~#sum~0.base| Int) (v_ArrVal_438 Int)) (= 4 (select (select (store |c_#memory_int| |main_~#sum~0.base| (store (select |c_#memory_int| |main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_438)) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8))))) is different from false [2022-01-31 11:41:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:22,735 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-01-31 11:41:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:41:22,735 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-01-31 11:41:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:22,736 INFO L225 Difference]: With dead ends: 92 [2022-01-31 11:41:22,736 INFO L226 Difference]: Without dead ends: 92 [2022-01-31 11:41:22,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=110, Invalid=457, Unknown=5, NotChecked=240, Total=812 [2022-01-31 11:41:22,737 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:22,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 296 Invalid, 0 Unknown, 225 Unchecked, 0.1s Time] [2022-01-31 11:41:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-31 11:41:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2022-01-31 11:41:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:41:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-01-31 11:41:22,739 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 47 [2022-01-31 11:41:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:22,739 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-01-31 11:41:22,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-01-31 11:41:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:41:22,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:22,740 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:22,770 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 11:41:22,951 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 11:41:22,951 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -897304422, now seen corresponding path program 6 times [2022-01-31 11:41:22,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:22,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473862013] [2022-01-31 11:41:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:22,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:22,965 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:22,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719049940] [2022-01-31 11:41:22,965 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:41:22,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:22,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:22,966 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 11:41:22,968 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 11:41:23,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:41:23,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:23,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:41:23,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:23,172 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:41:23,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:23,220 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 27 treesize of output 26 [2022-01-31 11:41:23,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:23,276 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 11:41:23,310 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 17 treesize of output 9 [2022-01-31 11:41:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-31 11:41:23,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:23,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_494) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 11:41:23,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_494) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 11:41:23,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 Int) (v_ArrVal_494 (Array Int Int))) (= (+ (- 3) (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_492)) |c_main_~#sum~0.base| v_ArrVal_494) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 11:41:23,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_146 Int)) (or (forall ((v_ArrVal_492 Int) (v_ArrVal_494 (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_146)) v_ArrVal_492)) |c_main_~#sum~0.base| v_ArrVal_494) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 3)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_146)))) is different from false [2022-01-31 11:41:23,443 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:41:23,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 45 [2022-01-31 11:41:23,448 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:23,449 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 44 treesize of output 44 [2022-01-31 11:41:23,451 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 13 treesize of output 9 [2022-01-31 11:41:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-01-31 11:41:23,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:23,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473862013] [2022-01-31 11:41:23,522 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:23,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719049940] [2022-01-31 11:41:23,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719049940] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:23,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:23,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-01-31 11:41:23,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583589570] [2022-01-31 11:41:23,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:23,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 11:41:23,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 11:41:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=275, Unknown=4, NotChecked=148, Total=506 [2022-01-31 11:41:23,524 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 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 11:41:25,571 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_146 Int)) (or (forall ((v_ArrVal_492 Int) (v_ArrVal_494 (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_146)) v_ArrVal_492)) |c_main_~#sum~0.base| v_ArrVal_494) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 3)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_146)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= c_main_~i~0 1) (= (+ (- 3) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1)) is different from false [2022-01-31 11:41:27,590 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_146 Int)) (or (forall ((v_ArrVal_492 Int) (v_ArrVal_494 (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_146)) v_ArrVal_492)) |c_main_~#sum~0.base| v_ArrVal_494) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 3)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_146)))) (<= 2 c_main_~i~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 3)) 1) (forall ((v_ArrVal_494 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_494) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) is different from false [2022-01-31 11:41:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:27,750 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-01-31 11:41:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:41:27,750 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-01-31 11:41:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:27,751 INFO L225 Difference]: With dead ends: 99 [2022-01-31 11:41:27,751 INFO L226 Difference]: Without dead ends: 99 [2022-01-31 11:41:27,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=106, Invalid=374, Unknown=6, NotChecked=270, Total=756 [2022-01-31 11:41:27,751 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:27,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 251 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 288 Invalid, 0 Unknown, 183 Unchecked, 0.1s Time] [2022-01-31 11:41:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-31 11:41:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2022-01-31 11:41:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 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 11:41:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-01-31 11:41:27,754 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 47 [2022-01-31 11:41:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:27,755 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-01-31 11:41:27,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 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 11:41:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-01-31 11:41:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:41:27,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:27,755 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:27,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-31 11:41:27,959 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 11:41:27,960 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash 899646937, now seen corresponding path program 4 times [2022-01-31 11:41:27,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:27,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054813429] [2022-01-31 11:41:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:27,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:28,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:28,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054813429] [2022-01-31 11:41:28,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054813429] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:28,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450797519] [2022-01-31 11:41:28,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:41:28,523 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:28,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:28,525 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 11:41:28,526 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 11:41:28,593 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:41:28,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:28,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 11:41:28,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:28,613 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 11:41:28,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:28,644 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 11:41:28,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:28,680 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 11:41:28,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:28,717 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 11:41:28,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:28,827 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 11:41:28,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:28,856 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 11:41:28,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:28,881 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 11:41:28,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:28,959 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 11:41:29,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:29,063 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:41:29,063 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 11:41:29,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:29,177 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:41:29,177 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 11:41:29,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:29,316 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:41:29,316 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 47 treesize of output 15 [2022-01-31 11:41:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:29,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:34,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_162 Int) (main_~a~0.offset Int) (v_main_~i~0_160 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_552))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_552 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse2 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_162))))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_160))))) (or (= (* c_~N~0 4) (+ .cse0 .cse1 .cse2 .cse3)) (not (= .cse0 4)) (not (= .cse1 4)) (not (= 4 .cse3))))))))) is different from false [2022-01-31 11:41:35,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_169 Int) (v_main_~i~0_162 Int) (main_~a~0.offset Int) (v_main_~i~0_160 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_552))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_552 (+ main_~a~0.offset (* 4 v_main_~i~0_169)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_162))))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_160))))) (or (not (= .cse0 4)) (= (* ~N~0 4) (+ .cse1 .cse0 .cse2 .cse3)) (not (= .cse1 4)) (not (= .cse2 4))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:41:35,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_169 Int) (v_main_~i~0_162 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_160 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_552))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_552 (+ main_~a~0.offset (* 4 v_main_~i~0_169)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_162))))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_160))))) (or (not (= .cse0 4)) (= (* ~N~0 4) (+ .cse1 .cse0 .cse2 .cse3)) (not (= .cse1 4)) (not (= .cse2 4)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 11:41:35,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_169 Int) (v_main_~i~0_162 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_160 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_552))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_552 (+ main_~a~0.offset (* 4 v_main_~i~0_169)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_162))))) (let ((.cse2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_160))))) (or (< (+ c_main_~i~0 3) ~N~0) (not (= .cse0 4)) (not (< (+ c_main_~i~0 2) ~N~0)) (= (* ~N~0 4) (+ .cse1 .cse0 .cse2 .cse3)) (not (= .cse1 4)) (not (= .cse2 4))))))))) is different from false [2022-01-31 11:41:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2022-01-31 11:41:35,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450797519] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:35,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:41:35,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 48 [2022-01-31 11:41:35,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925364863] [2022-01-31 11:41:35,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:35,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 11:41:35,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:35,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 11:41:35,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1725, Unknown=8, NotChecked=348, Total=2256 [2022-01-31 11:41:35,830 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 48 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 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 11:41:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:37,126 INFO L93 Difference]: Finished difference Result 203 states and 255 transitions. [2022-01-31 11:41:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-31 11:41:37,127 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 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 47 [2022-01-31 11:41:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:37,127 INFO L225 Difference]: With dead ends: 203 [2022-01-31 11:41:37,127 INFO L226 Difference]: Without dead ends: 198 [2022-01-31 11:41:37,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 82 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=378, Invalid=3290, Unknown=8, NotChecked=484, Total=4160 [2022-01-31 11:41:37,129 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 71 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 738 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:37,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 223 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 608 Invalid, 0 Unknown, 738 Unchecked, 0.3s Time] [2022-01-31 11:41:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-31 11:41:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2022-01-31 11:41:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 147 states have (on average 1.2925170068027212) internal successors, (190), 147 states have internal predecessors, (190), 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 11:41:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 196 transitions. [2022-01-31 11:41:37,132 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 196 transitions. Word has length 47 [2022-01-31 11:41:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:37,133 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 196 transitions. [2022-01-31 11:41:37,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 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 11:41:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 196 transitions. [2022-01-31 11:41:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:41:37,133 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:37,134 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:37,153 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 11:41:37,349 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 11:41:37,350 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1292426776, now seen corresponding path program 1 times [2022-01-31 11:41:37,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:37,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671002383] [2022-01-31 11:41:37,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:37,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:37,358 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:37,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83005396] [2022-01-31 11:41:37,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:37,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:37,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:37,359 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 11:41:37,360 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 11:41:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:37,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 11:41:37,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:37,471 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:41:37,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:37,505 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 23 treesize of output 22 [2022-01-31 11:41:37,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:37,531 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 23 treesize of output 22 [2022-01-31 11:41:37,557 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 11:41:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:41:37,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:39,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_180 Int)) (or (forall ((v_ArrVal_614 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_180)) v_ArrVal_614) c_main_~a~0.offset) 4)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_180)))) is different from false [2022-01-31 11:41:41,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_181)) (forall ((v_main_~i~0_180 Int) (v_ArrVal_614 Int) (v_ArrVal_611 Int)) (or (not (<= (+ v_main_~i~0_181 1) v_main_~i~0_180)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_181) c_main_~a~0.offset) v_ArrVal_611) (+ c_main_~a~0.offset (* 4 v_main_~i~0_180)) v_ArrVal_614) c_main_~a~0.offset) 4))))) is different from false [2022-01-31 11:41:44,006 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 51 treesize of output 45 [2022-01-31 11:41:44,011 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:41:44,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 156 [2022-01-31 11:41:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 8 refuted. 1 times theorem prover too weak. 16 trivial. 3 not checked. [2022-01-31 11:41:44,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:44,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671002383] [2022-01-31 11:41:44,077 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:44,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83005396] [2022-01-31 11:41:44,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83005396] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:44,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:44,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2022-01-31 11:41:44,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627861420] [2022-01-31 11:41:44,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:44,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:41:44,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:41:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=182, Unknown=3, NotChecked=58, Total=306 [2022-01-31 11:41:44,078 INFO L87 Difference]: Start difference. First operand 154 states and 196 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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 11:41:46,096 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_181)) (forall ((v_main_~i~0_180 Int) (v_ArrVal_614 Int) (v_ArrVal_611 Int)) (or (not (<= (+ v_main_~i~0_181 1) v_main_~i~0_180)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_181) c_main_~a~0.offset) v_ArrVal_611) (+ c_main_~a~0.offset (* 4 v_main_~i~0_180)) v_ArrVal_614) c_main_~a~0.offset) 4))))) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 4)) is different from false [2022-01-31 11:41:48,105 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (forall ((v_main_~i~0_181 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_181)) (forall ((v_main_~i~0_180 Int) (v_ArrVal_614 Int) (v_ArrVal_611 Int)) (or (not (<= (+ v_main_~i~0_181 1) v_main_~i~0_180)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_181) c_main_~a~0.offset) v_ArrVal_611) (+ c_main_~a~0.offset (* 4 v_main_~i~0_180)) v_ArrVal_614) c_main_~a~0.offset) 4))))) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_180 Int)) (or (forall ((v_ArrVal_614 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_180)) v_ArrVal_614) c_main_~a~0.offset) 4)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_180)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 4)) is different from false [2022-01-31 11:41:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:48,176 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2022-01-31 11:41:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 11:41:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-01-31 11:41:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:48,177 INFO L225 Difference]: With dead ends: 169 [2022-01-31 11:41:48,177 INFO L226 Difference]: Without dead ends: 169 [2022-01-31 11:41:48,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=77, Invalid=206, Unknown=5, NotChecked=132, Total=420 [2022-01-31 11:41:48,177 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:48,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 191 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2022-01-31 11:41:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-01-31 11:41:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2022-01-31 11:41:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 151 states have (on average 1.2980132450331126) internal successors, (196), 151 states have internal predecessors, (196), 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 11:41:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2022-01-31 11:41:48,180 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 47 [2022-01-31 11:41:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:48,181 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2022-01-31 11:41:48,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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 11:41:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2022-01-31 11:41:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:41:48,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:48,181 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:48,198 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 11:41:48,391 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 11:41:48,391 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1797985401, now seen corresponding path program 2 times [2022-01-31 11:41:48,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:48,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155537085] [2022-01-31 11:41:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:48,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:48,400 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:48,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50242271] [2022-01-31 11:41:48,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:41:48,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:48,406 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 11:41:48,408 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 11:41:48,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:41:48,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:48,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:41:48,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:48,514 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 11:41:48,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:48,549 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 25 treesize of output 24 [2022-01-31 11:41:48,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:48,571 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 25 treesize of output 24 [2022-01-31 11:41:48,588 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 11:41:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:48,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:48,708 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 16 treesize of output 14 [2022-01-31 11:41:48,709 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 28 treesize of output 24 [2022-01-31 11:41:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:48,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155537085] [2022-01-31 11:41:48,755 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50242271] [2022-01-31 11:41:48,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50242271] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:48,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:48,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-01-31 11:41:48,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034654973] [2022-01-31 11:41:48,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:48,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 11:41:48,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 11:41:48,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:41:48,757 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:48,905 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2022-01-31 11:41:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:41:48,906 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-01-31 11:41:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:48,906 INFO L225 Difference]: With dead ends: 132 [2022-01-31 11:41:48,906 INFO L226 Difference]: Without dead ends: 132 [2022-01-31 11:41:48,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:41:48,908 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:48,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 178 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:41:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-01-31 11:41:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2022-01-31 11:41:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 116 states have internal predecessors, (141), 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 11:41:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2022-01-31 11:41:48,910 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 47 [2022-01-31 11:41:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:48,911 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2022-01-31 11:41:48,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2022-01-31 11:41:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 11:41:48,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:48,911 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:48,929 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 11:41:49,128 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 11:41:49,128 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1182980387, now seen corresponding path program 5 times [2022-01-31 11:41:49,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828193054] [2022-01-31 11:41:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:49,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:49,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:49,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828193054] [2022-01-31 11:41:49,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828193054] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:49,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755204278] [2022-01-31 11:41:49,241 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:41:49,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:49,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:49,242 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 11:41:49,243 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 11:41:49,352 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 11:41:49,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:49,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:41:49,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:49,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:49,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755204278] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:49,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:41:49,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:41:49,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890433422] [2022-01-31 11:41:49,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:49,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:41:49,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:41:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:41:49,577 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:50,050 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2022-01-31 11:41:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:41:50,050 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-01-31 11:41:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:50,050 INFO L225 Difference]: With dead ends: 129 [2022-01-31 11:41:50,051 INFO L226 Difference]: Without dead ends: 129 [2022-01-31 11:41:50,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 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 11:41:50,051 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 90 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:50,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 64 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 11:41:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-01-31 11:41:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2022-01-31 11:41:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 86 states have internal predecessors, (101), 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 11:41:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2022-01-31 11:41:50,054 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 49 [2022-01-31 11:41:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:50,055 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2022-01-31 11:41:50,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:41:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2022-01-31 11:41:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:41:50,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:50,056 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:50,089 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 11:41:50,272 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 11:41:50,273 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1207498923, now seen corresponding path program 7 times [2022-01-31 11:41:50,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:50,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316083490] [2022-01-31 11:41:50,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:50,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:50,281 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:50,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016532942] [2022-01-31 11:41:50,281 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:41:50,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:50,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:50,282 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 11:41:50,283 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 11:41:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:50,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:41:50,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:50,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:41:50,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:50,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316083490] [2022-01-31 11:41:50,576 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:50,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016532942] [2022-01-31 11:41:50,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016532942] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:50,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:50,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 11:41:50,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019334520] [2022-01-31 11:41:50,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:50,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:41:50,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:50,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:41:50,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:41:50,577 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 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 11:41:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:50,707 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-01-31 11:41:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:41:50,707 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 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 50 [2022-01-31 11:41:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:50,708 INFO L225 Difference]: With dead ends: 99 [2022-01-31 11:41:50,708 INFO L226 Difference]: Without dead ends: 77 [2022-01-31 11:41:50,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-01-31 11:41:50,711 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 90 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:50,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 72 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:41:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-31 11:41:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-01-31 11:41:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.196969696969697) internal successors, (79), 66 states have internal predecessors, (79), 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 11:41:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-01-31 11:41:50,714 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 50 [2022-01-31 11:41:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:50,715 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-01-31 11:41:50,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 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 11:41:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-01-31 11:41:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:41:50,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:50,715 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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 11:41:50,734 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 11:41:50,932 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 11:41:50,932 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash 113363133, now seen corresponding path program 8 times [2022-01-31 11:41:50,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:50,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813072669] [2022-01-31 11:41:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:50,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:50,962 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:50,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241958645] [2022-01-31 11:41:50,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:41:50,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:50,975 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 11:41:50,976 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 11:41:51,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:41:51,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:51,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 11:41:51,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:51,173 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:41:51,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:51,225 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 11:41:51,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:51,275 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 11:41:51,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:51,313 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 11:41:51,336 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 11:41:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:41:51,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:51,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_845) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 11:41:51,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_845) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:41:51,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_845) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 11:41:51,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_845) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 11:41:51,455 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:51,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-01-31 11:41:51,460 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:51,460 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 11:41:51,463 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 11:41:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2022-01-31 11:41:51,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:51,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813072669] [2022-01-31 11:41:51,596 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:51,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241958645] [2022-01-31 11:41:51,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241958645] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:51,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:51,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 11:41:51,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043464947] [2022-01-31 11:41:51,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:51,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 11:41:51,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:51,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 11:41:51,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-01-31 11:41:51,597 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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 11:41:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:51,944 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2022-01-31 11:41:51,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:41:51,944 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 11:41:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:51,945 INFO L225 Difference]: With dead ends: 90 [2022-01-31 11:41:51,945 INFO L226 Difference]: Without dead ends: 90 [2022-01-31 11:41:51,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=495, Unknown=4, NotChecked=196, Total=812 [2022-01-31 11:41:51,946 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 81 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:51,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 216 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 551 Invalid, 0 Unknown, 328 Unchecked, 0.3s Time] [2022-01-31 11:41:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-31 11:41:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2022-01-31 11:41:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 72 states have internal predecessors, (86), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:41:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2022-01-31 11:41:51,948 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 55 [2022-01-31 11:41:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:51,948 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2022-01-31 11:41:51,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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 11:41:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2022-01-31 11:41:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:41:51,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:51,949 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:51,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-31 11:41:52,149 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 11:41:52,149 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1629447202, now seen corresponding path program 9 times [2022-01-31 11:41:52,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:52,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961874973] [2022-01-31 11:41:52,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:52,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:52,160 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:52,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346561627] [2022-01-31 11:41:52,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:41:52,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:52,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:52,161 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 11:41:52,168 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 11:41:52,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:41:52,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:52,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:41:52,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:52,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:41:52,408 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:41:52,408 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 28 treesize of output 27 [2022-01-31 11:41:52,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:52,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-31 11:41:52,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:52,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-31 11:41:52,556 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:52,557 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 24 treesize of output 24 [2022-01-31 11:41:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-31 11:41:52,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:52,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_913 (Array Int Int))) (let ((.cse0 (+ main_~i~0 2))) (or (< .cse0 c_~N~0) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_913) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< c_~N~0 .cse0)))) is different from false [2022-01-31 11:41:52,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_268 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_911 Int)) (or (= (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_911)) |c_main_~#sum~0.base| v_ArrVal_913) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_268))) 4) (<= (+ 2 v_main_~i~0_268) c_main_~i~0) (< c_main_~i~0 (+ v_main_~i~0_268 1)))) is different from false [2022-01-31 11:41:52,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_268 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_911 Int)) (or (< c_main_~i~0 v_main_~i~0_268) (<= (+ v_main_~i~0_268 1) c_main_~i~0) (= (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 4) v_ArrVal_911)) |c_main_~#sum~0.base| v_ArrVal_913) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_268))) 4))) is different from false [2022-01-31 11:41:52,935 INFO L353 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2022-01-31 11:41:52,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 11:41:52,940 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-01-31 11:41:52,940 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 44 treesize of output 32 [2022-01-31 11:41:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 23 trivial. 20 not checked. [2022-01-31 11:41:52,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:52,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961874973] [2022-01-31 11:41:52,977 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:52,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346561627] [2022-01-31 11:41:52,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346561627] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:52,977 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:52,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2022-01-31 11:41:52,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101215501] [2022-01-31 11:41:52,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:52,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 11:41:52,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:52,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 11:41:52,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2022-01-31 11:41:52,978 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 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 11:41:53,549 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_268 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_911 Int)) (or (< c_main_~i~0 v_main_~i~0_268) (<= (+ v_main_~i~0_268 1) c_main_~i~0) (= (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 4) v_ArrVal_911)) |c_main_~#sum~0.base| v_ArrVal_913) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_268))) 4))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 4)) is different from false [2022-01-31 11:41:55,559 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_268 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_911 Int)) (or (= (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_911)) |c_main_~#sum~0.base| v_ArrVal_913) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_268))) 4) (<= (+ 2 v_main_~i~0_268) c_main_~i~0) (< c_main_~i~0 (+ v_main_~i~0_268 1)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset (- 4))) 4)) is different from false [2022-01-31 11:41:56,190 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (forall ((v_main_~i~0_268 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_911 Int)) (or (< c_main_~i~0 v_main_~i~0_268) (<= (+ v_main_~i~0_268 1) c_main_~i~0) (= (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 4) v_ArrVal_911)) |c_main_~#sum~0.base| v_ArrVal_913) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_268))) 4))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (< c_main_~i~0 c_~N~0) (= (select .cse0 (+ .cse1 c_main_~a~0.offset)) 4) (= (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4))) 4))) is different from false [2022-01-31 11:41:58,205 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_259 Int)) (and (<= c_main_~i~0 (+ v_main_~i~0_259 1)) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_259) (- 4))) 4) (< v_main_~i~0_259 c_~N~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_268 Int) (v_ArrVal_913 (Array Int Int)) (v_ArrVal_911 Int)) (or (= (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_911)) |c_main_~#sum~0.base| v_ArrVal_913) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_268))) 4) (<= (+ 2 v_main_~i~0_268) c_main_~i~0) (< c_main_~i~0 (+ v_main_~i~0_268 1)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset (- 4))) 4)) is different from false [2022-01-31 11:41:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:58,280 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-01-31 11:41:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 11:41:58,280 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 11:41:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:58,281 INFO L225 Difference]: With dead ends: 120 [2022-01-31 11:41:58,281 INFO L226 Difference]: Without dead ends: 120 [2022-01-31 11:41:58,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=122, Invalid=443, Unknown=15, NotChecked=350, Total=930 [2022-01-31 11:41:58,281 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:58,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 172 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 138 Unchecked, 0.0s Time] [2022-01-31 11:41:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-31 11:41:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2022-01-31 11:41:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 101 states have internal predecessors, (126), 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 11:41:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2022-01-31 11:41:58,283 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 55 [2022-01-31 11:41:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:58,284 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2022-01-31 11:41:58,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 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 11:41:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2022-01-31 11:41:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:41:58,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:58,284 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:41:58,302 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 11:41:58,498 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 11:41:58,498 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash 167504157, now seen corresponding path program 6 times [2022-01-31 11:41:58,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:58,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254427127] [2022-01-31 11:41:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:58,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:59,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:41:59,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:59,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254427127] [2022-01-31 11:41:59,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254427127] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:59,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111039853] [2022-01-31 11:41:59,057 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:41:59,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:59,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:59,068 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 11:41:59,081 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 11:41:59,178 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:41:59,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:59,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-31 11:41:59,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:59,202 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 11:41:59,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,250 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 11:41:59,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,297 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 11:41:59,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,353 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 11:41:59,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,397 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 11:41:59,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,532 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 11:41:59,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,562 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 11:41:59,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,597 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 11:41:59,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,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 11:41:59,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,710 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 11:41:59,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:59,847 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:41:59,847 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 11:41:59,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:00,000 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:42:00,000 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 11:42:00,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:00,171 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:42:00,171 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 11:42:00,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:00,356 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:42:00,356 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 58 treesize of output 18 [2022-01-31 11:42:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:42:00,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:42:25,071 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_289 Int) (v_ArrVal_985 (Array Int Int)) (v_main_~i~0_287 Int) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_291 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_985))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse8 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_985 (+ main_~a~0.offset (* main_~i~0 4))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_291))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse6 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_289))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse6 .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= 4 .cse2)) (let ((.cse4 (* c_~N~0 4)) (.cse3 (+ .cse5 .cse1 .cse6 .cse0 .cse2))) (and (< .cse3 (+ .cse4 1)) (<= .cse4 .cse3))) (not (= .cse5 4)))))))))) is different from false [2022-01-31 11:42:53,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)) (forall ((v_main_~i~0_289 Int) (v_ArrVal_985 (Array Int Int)) (v_main_~i~0_287 Int) (v_main_~i~0_299 Int) (main_~a~0.offset Int) (v_main_~i~0_291 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_985))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_985 (+ (* 4 v_main_~i~0_299) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_291))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_289))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse6 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (let ((.cse4 (+ .cse2 .cse1 .cse5 .cse6 .cse0)) (.cse3 (* ~N~0 4))) (and (<= .cse3 .cse4) (< .cse4 (+ .cse3 1)))) (not (= .cse6 4)))))))))))) is different from false [2022-01-31 11:42:58,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_289 Int) (v_ArrVal_985 (Array Int Int)) (v_main_~i~0_287 Int) (v_main_~i~0_299 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_291 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_985))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_985 (+ (* 4 v_main_~i~0_299) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_291))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_289))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse6 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0) (let ((.cse4 (+ .cse2 .cse1 .cse5 .cse6 .cse0)) (.cse3 (* ~N~0 4))) (and (<= .cse3 .cse4) (< .cse4 (+ .cse3 1)))) (not (= .cse6 4)))))))))) is different from false [2022-01-31 11:43:07,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_289 Int) (v_ArrVal_985 (Array Int Int)) (v_main_~i~0_287 Int) (v_main_~i~0_299 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_291 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_985))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_985 (+ (* 4 v_main_~i~0_299) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_291))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_289))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse6 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (or (not (= 4 .cse0)) (< (+ c_main_~i~0 3) ~N~0) (not (= .cse1 4)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse2 4)) (let ((.cse4 (+ .cse2 .cse1 .cse5 .cse6 .cse0)) (.cse3 (* ~N~0 4))) (and (<= .cse3 .cse4) (< .cse4 (+ .cse3 1)))) (not (= .cse6 4)))))))))) is different from false [2022-01-31 11:43:16,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_289 Int) (v_ArrVal_985 (Array Int Int)) (v_main_~i~0_287 Int) (v_main_~i~0_299 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_291 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_985))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_985 (+ (* 4 v_main_~i~0_299) main_~a~0.offset))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_291))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_289))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse6 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_287))))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= 4 .cse0)) (not (= .cse1 4)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= .cse2 4)) (let ((.cse4 (+ .cse2 .cse1 .cse5 .cse6 .cse0)) (.cse3 (* ~N~0 4))) (and (<= .cse3 .cse4) (< .cse4 (+ .cse3 1)))) (not (= .cse6 4)))))))))) is different from false [2022-01-31 11:43:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2022-01-31 11:43:22,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111039853] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:43:22,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:43:22,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 21] total 58 [2022-01-31 11:43:22,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492914449] [2022-01-31 11:43:22,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:43:22,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 11:43:22,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:43:22,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 11:43:22,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2569, Unknown=14, NotChecked=530, Total=3306 [2022-01-31 11:43:22,383 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 58 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 55 states have internal predecessors, (103), 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 11:43:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:43:25,484 INFO L93 Difference]: Finished difference Result 217 states and 276 transitions. [2022-01-31 11:43:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-31 11:43:25,485 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 55 states have internal predecessors, (103), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 11:43:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:43:25,485 INFO L225 Difference]: With dead ends: 217 [2022-01-31 11:43:25,485 INFO L226 Difference]: Without dead ends: 213 [2022-01-31 11:43:25,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 87 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=572, Invalid=5439, Unknown=15, NotChecked=780, Total=6806 [2022-01-31 11:43:25,487 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 53 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1099 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:43:25,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 323 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 970 Invalid, 0 Unknown, 1099 Unchecked, 0.6s Time] [2022-01-31 11:43:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-01-31 11:43:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2022-01-31 11:43:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 192 states have (on average 1.28125) internal successors, (246), 192 states have internal predecessors, (246), 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 11:43:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 252 transitions. [2022-01-31 11:43:25,490 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 252 transitions. Word has length 55 [2022-01-31 11:43:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:43:25,490 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 252 transitions. [2022-01-31 11:43:25,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 55 states have internal predecessors, (103), 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 11:43:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 252 transitions. [2022-01-31 11:43:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:43:25,491 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:43:25,491 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:43:25,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-01-31 11:43:25,691 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 11:43:25,692 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:43:25,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:43:25,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1864715515, now seen corresponding path program 3 times [2022-01-31 11:43:25,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:43:25,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594398923] [2022-01-31 11:43:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:43:25,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:43:25,701 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:43:25,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559752859] [2022-01-31 11:43:25,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:43:25,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:43:25,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:43:25,704 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 11:43:25,704 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 11:43:25,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:43:25,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:43:25,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 11:43:25,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:43:26,050 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:43:26,116 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:43:26,117 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 30 [2022-01-31 11:43:26,201 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:43:26,202 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 29 treesize of output 34 [2022-01-31 11:43:26,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:43:26,333 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 11:43:26,373 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 11:43:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-31 11:43:26,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:43:26,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1062) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 11:43:26,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1062) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:43:26,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_1058 Int) (v_main_~i~0_317 Int) (v_ArrVal_1060 Int) (v_ArrVal_1062 (Array Int Int))) (or (not (<= v_main_~i~0_317 (+ main_~i~0 1))) (< (+ v_main_~i~0_317 1) c_~N~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1058) (+ c_main_~a~0.offset (* 4 v_main_~i~0_317)) v_ArrVal_1060)) |c_main_~#sum~0.base| v_ArrVal_1062) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 4))) is different from false [2022-01-31 11:43:26,848 INFO L353 Elim1Store]: treesize reduction 96, result has 40.4 percent of original size [2022-01-31 11:43:26,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 81 [2022-01-31 11:43:26,863 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:43:26,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 98 [2022-01-31 11:43:26,869 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 11:43:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2022-01-31 11:43:27,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:43:27,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594398923] [2022-01-31 11:43:27,163 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:43:27,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559752859] [2022-01-31 11:43:27,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559752859] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:43:27,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:43:27,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2022-01-31 11:43:27,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973447953] [2022-01-31 11:43:27,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:43:27,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 11:43:27,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:43:27,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 11:43:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=874, Unknown=7, NotChecked=192, Total=1260 [2022-01-31 11:43:27,164 INFO L87 Difference]: Start difference. First operand 199 states and 252 transitions. Second operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 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 11:43:27,794 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 4) (forall ((main_~i~0 Int) (v_ArrVal_1058 Int) (v_main_~i~0_317 Int) (v_ArrVal_1060 Int) (v_ArrVal_1062 (Array Int Int))) (or (not (<= v_main_~i~0_317 (+ main_~i~0 1))) (< (+ v_main_~i~0_317 1) c_~N~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1058) (+ c_main_~a~0.offset (* 4 v_main_~i~0_317)) v_ArrVal_1060)) |c_main_~#sum~0.base| v_ArrVal_1062) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 4))) (= c_main_~i~0 1) (< 3 c_~N~0)) is different from false [2022-01-31 11:43:28,330 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 4) (forall ((main_~i~0 Int) (v_ArrVal_1058 Int) (v_main_~i~0_317 Int) (v_ArrVal_1060 Int) (v_ArrVal_1062 (Array Int Int))) (or (not (<= v_main_~i~0_317 (+ main_~i~0 1))) (< (+ v_main_~i~0_317 1) c_~N~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1058) (+ c_main_~a~0.offset (* 4 v_main_~i~0_317)) v_ArrVal_1060)) |c_main_~#sum~0.base| v_ArrVal_1062) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 4))) (< 3 c_~N~0)) is different from false [2022-01-31 11:43:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:43:28,803 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2022-01-31 11:43:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 11:43:28,804 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 11:43:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:43:28,805 INFO L225 Difference]: With dead ends: 271 [2022-01-31 11:43:28,805 INFO L226 Difference]: Without dead ends: 271 [2022-01-31 11:43:28,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=373, Invalid=1360, Unknown=9, NotChecked=420, Total=2162 [2022-01-31 11:43:28,805 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 207 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:43:28,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 246 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 404 Invalid, 0 Unknown, 362 Unchecked, 0.3s Time] [2022-01-31 11:43:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-01-31 11:43:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 215. [2022-01-31 11:43:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.2692307692307692) internal successors, (264), 208 states have internal predecessors, (264), 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 11:43:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2022-01-31 11:43:28,809 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 55 [2022-01-31 11:43:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:43:28,809 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2022-01-31 11:43:28,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 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 11:43:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2022-01-31 11:43:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:43:28,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:43:28,810 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:43:28,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-31 11:43:29,010 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 11:43:29,010 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:43:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:43:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1924693156, now seen corresponding path program 4 times [2022-01-31 11:43:29,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:43:29,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864050938] [2022-01-31 11:43:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:43:29,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:43:29,019 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:43:29,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574678055] [2022-01-31 11:43:29,019 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:43:29,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:43:29,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:43:29,020 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 11:43:29,034 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 11:43:29,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:43:29,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:43:29,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-31 11:43:29,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:43:29,237 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:43:29,296 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:43:29,296 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 11:43:29,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:43:29,360 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 11:43:29,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:43:29,405 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 11:43:29,441 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 11:43:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 11:43:29,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:43:29,512 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1130) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 11:43:29,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1130) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:43:29,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1130) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:43:29,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 (Array Int Int)) (v_ArrVal_1128 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_1128)) |c_main_~#sum~0.base| v_ArrVal_1130) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:43:29,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_338 Int)) (or (forall ((v_ArrVal_1130 (Array Int Int)) (v_ArrVal_1128 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_338)) v_ArrVal_1128)) |c_main_~#sum~0.base| v_ArrVal_1130) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_338)))) is different from false [2022-01-31 11:43:30,752 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:43:30,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-01-31 11:43:30,757 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:43:30,757 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 11:43:30,759 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 11:43:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2022-01-31 11:43:30,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:43:30,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864050938] [2022-01-31 11:43:30,878 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:43:30,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574678055] [2022-01-31 11:43:30,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574678055] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:43:30,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:43:30,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 11:43:30,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536875580] [2022-01-31 11:43:30,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:43:30,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 11:43:30,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:43:30,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 11:43:30,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=381, Unknown=5, NotChecked=220, Total=702 [2022-01-31 11:43:30,879 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:43:32,958 WARN L838 $PredicateComparison]: unable to prove that (and (= 1 (+ (- 1) c_main_~i~0)) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_338 Int)) (or (forall ((v_ArrVal_1130 (Array Int Int)) (v_ArrVal_1128 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_338)) v_ArrVal_1128)) |c_main_~#sum~0.base| v_ArrVal_1130) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_338)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 4)) is different from false [2022-01-31 11:43:34,991 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_338 Int)) (or (forall ((v_ArrVal_1130 (Array Int Int)) (v_ArrVal_1128 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_338)) v_ArrVal_1128)) |c_main_~#sum~0.base| v_ArrVal_1130) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_338)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4) (<= 3 c_main_~i~0)) is different from false [2022-01-31 11:43:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:43:35,236 INFO L93 Difference]: Finished difference Result 321 states and 407 transitions. [2022-01-31 11:43:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 11:43:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 11:43:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:43:35,238 INFO L225 Difference]: With dead ends: 321 [2022-01-31 11:43:35,238 INFO L226 Difference]: Without dead ends: 321 [2022-01-31 11:43:35,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=124, Invalid=497, Unknown=7, NotChecked=364, Total=992 [2022-01-31 11:43:35,238 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:43:35,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 191 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 347 Invalid, 0 Unknown, 379 Unchecked, 0.2s Time] [2022-01-31 11:43:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-01-31 11:43:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 277. [2022-01-31 11:43:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 270 states have (on average 1.2851851851851852) internal successors, (347), 270 states have internal predecessors, (347), 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 11:43:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 353 transitions. [2022-01-31 11:43:35,242 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 353 transitions. Word has length 55 [2022-01-31 11:43:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:43:35,243 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 353 transitions. [2022-01-31 11:43:35,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:43:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 353 transitions. [2022-01-31 11:43:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:43:35,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:43:35,244 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:43:35,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-31 11:43:35,448 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 11:43:35,448 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:43:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:43:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash -127741797, now seen corresponding path program 5 times [2022-01-31 11:43:35,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:43:35,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213372913] [2022-01-31 11:43:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:43:35,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:43:35,457 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:43:35,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073365295] [2022-01-31 11:43:35,457 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:43:35,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:43:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:43:35,468 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 11:43:35,468 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 11:43:35,642 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 11:43:35,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:43:35,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:43:35,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:43:35,680 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 11:43:35,718 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:43:35,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, 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 11:43:35,751 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:43:35,751 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 11:43:35,778 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:43:35,778 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 11:43:35,800 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 11:43:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:43:35,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:43:35,989 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 16 treesize of output 14 [2022-01-31 11:43:35,991 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 28 treesize of output 24 [2022-01-31 11:43:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:43:36,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:43:36,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213372913] [2022-01-31 11:43:36,012 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:43:36,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073365295] [2022-01-31 11:43:36,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073365295] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:43:36,012 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:43:36,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2022-01-31 11:43:36,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155282485] [2022-01-31 11:43:36,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:43:36,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 11:43:36,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:43:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 11:43:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-31 11:43:36,013 INFO L87 Difference]: Start difference. First operand 277 states and 353 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:43:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:43:36,314 INFO L93 Difference]: Finished difference Result 237 states and 298 transitions. [2022-01-31 11:43:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:43:36,315 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 11:43:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:43:36,315 INFO L225 Difference]: With dead ends: 237 [2022-01-31 11:43:36,315 INFO L226 Difference]: Without dead ends: 237 [2022-01-31 11:43:36,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:43:36,316 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:43:36,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 223 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:43:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-01-31 11:43:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2022-01-31 11:43:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 210 states have internal predecessors, (266), 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 11:43:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2022-01-31 11:43:36,319 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 55 [2022-01-31 11:43:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:43:36,319 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2022-01-31 11:43:36,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:43:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2022-01-31 11:43:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 11:43:36,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:43:36,320 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:43:36,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-01-31 11:43:36,527 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 11:43:36,527 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:43:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:43:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1145420255, now seen corresponding path program 7 times [2022-01-31 11:43:36,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:43:36,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804203266] [2022-01-31 11:43:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:43:36,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:43:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:43:36,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:43:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:43:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:43:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:43:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:43:36,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:43:36,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804203266] [2022-01-31 11:43:36,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804203266] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:43:36,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971794951] [2022-01-31 11:43:36,690 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:43:36,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:43:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:43:36,691 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 11:43:36,692 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 11:43:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:43:36,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:43:36,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:43:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:43:36,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:43:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:43:37,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971794951] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:43:37,084 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:43:37,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 11:43:37,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678873999] [2022-01-31 11:43:37,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:43:37,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:43:37,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:43:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:43:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:43:37,085 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 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 11:43:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:43:37,588 INFO L93 Difference]: Finished difference Result 248 states and 314 transitions. [2022-01-31 11:43:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 11:43:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 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 57 [2022-01-31 11:43:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:43:37,589 INFO L225 Difference]: With dead ends: 248 [2022-01-31 11:43:37,589 INFO L226 Difference]: Without dead ends: 248 [2022-01-31 11:43:37,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 11:43:37,590 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 137 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:43:37,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 79 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 11:43:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-01-31 11:43:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 196. [2022-01-31 11:43:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 189 states have internal predecessors, (243), 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 11:43:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 249 transitions. [2022-01-31 11:43:37,593 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 249 transitions. Word has length 57 [2022-01-31 11:43:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:43:37,593 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 249 transitions. [2022-01-31 11:43:37,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 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 11:43:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 249 transitions. [2022-01-31 11:43:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:43:37,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:43:37,594 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:43:37,611 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 11:43:37,800 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 11:43:37,800 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:43:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:43:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1665838481, now seen corresponding path program 10 times [2022-01-31 11:43:37,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:43:37,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890381367] [2022-01-31 11:43:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:43:37,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:43:37,815 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:43:37,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023156157] [2022-01-31 11:43:37,815 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:43:37,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:43:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:43:37,816 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 11:43:37,817 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 11:43:37,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:43:37,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:43:37,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:43:37,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:43:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:43:38,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:43:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:43:38,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:43:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890381367] [2022-01-31 11:43:38,203 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:43:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023156157] [2022-01-31 11:43:38,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023156157] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:43:38,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:43:38,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-01-31 11:43:38,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559227185] [2022-01-31 11:43:38,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:43:38,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:43:38,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:43:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:43:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:43:38,204 INFO L87 Difference]: Start difference. First operand 196 states and 249 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 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 11:43:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:43:38,448 INFO L93 Difference]: Finished difference Result 152 states and 181 transitions. [2022-01-31 11:43:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:43:38,448 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 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 58 [2022-01-31 11:43:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:43:38,448 INFO L225 Difference]: With dead ends: 152 [2022-01-31 11:43:38,449 INFO L226 Difference]: Without dead ends: 124 [2022-01-31 11:43:38,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2022-01-31 11:43:38,450 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 99 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:43:38,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 127 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:43:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-31 11:43:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2022-01-31 11:43:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 106 states have internal predecessors, (133), 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 11:43:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 139 transitions. [2022-01-31 11:43:38,452 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 139 transitions. Word has length 58 [2022-01-31 11:43:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:43:38,452 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 139 transitions. [2022-01-31 11:43:38,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 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 11:43:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2022-01-31 11:43:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:43:38,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:43:38,453 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:43:38,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-01-31 11:43:38,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-31 11:43:38,663 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:43:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:43:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1580497951, now seen corresponding path program 11 times [2022-01-31 11:43:38,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:43:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845291926] [2022-01-31 11:43:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:43:38,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:43:38,676 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:43:38,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578341516] [2022-01-31 11:43:38,676 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:43:38,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:43:38,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:43:38,677 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:43:38,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-01-31 11:43:38,916 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:43:38,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:43:38,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-31 11:43:38,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:43:38,935 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 11:43:39,043 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 31 treesize of output 15 [2022-01-31 11:43:39,088 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 11:43:39,116 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 11:43:39,151 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 11:43:39,178 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 11:43:39,200 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 21 treesize of output 9 [2022-01-31 11:43:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:43:39,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:43:39,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1414) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 11:43:39,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1414) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) (- 3)) 1)) is different from false [2022-01-31 11:43:39,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1414) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) (- 3)) 1)) is different from false [2022-01-31 11:43:39,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1414) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16))) 1)) is different from false [2022-01-31 11:43:39,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1414) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) (- 3)) 1)) is different from false [2022-01-31 11:43:39,355 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:43:39,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-01-31 11:43:39,359 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:43:39,359 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 44 treesize of output 44 [2022-01-31 11:43:39,361 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 13 treesize of output 9 [2022-01-31 11:43:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 35 not checked. [2022-01-31 11:43:39,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:43:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845291926] [2022-01-31 11:43:39,443 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:43:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578341516] [2022-01-31 11:43:39,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578341516] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:43:39,443 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:43:39,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2022-01-31 11:43:39,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469234780] [2022-01-31 11:43:39,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:43:39,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 11:43:39,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:43:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 11:43:39,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=319, Unknown=5, NotChecked=200, Total=600 [2022-01-31 11:43:39,444 INFO L87 Difference]: Start difference. First operand 113 states and 139 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 11:43:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:43:39,803 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-01-31 11:43:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:43:39,804 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-01-31 11:43:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:43:39,806 INFO L225 Difference]: With dead ends: 162 [2022-01-31 11:43:39,806 INFO L226 Difference]: Without dead ends: 162 [2022-01-31 11:43:39,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 97 SyntacticMatches, 15 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=419, Unknown=5, NotChecked=230, Total=756 [2022-01-31 11:43:39,807 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:43:39,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 319 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 628 Invalid, 0 Unknown, 314 Unchecked, 0.3s Time] [2022-01-31 11:43:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-01-31 11:43:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2022-01-31 11:43:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 135 states have internal predecessors, (168), 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 11:43:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-01-31 11:43:39,828 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 63 [2022-01-31 11:43:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:43:39,828 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-01-31 11:43:39,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 11:43:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-01-31 11:43:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:43:39,829 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:43:39,829 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:43:39,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-01-31 11:43:40,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-31 11:43:40,030 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:43:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:43:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash 971659010, now seen corresponding path program 12 times [2022-01-31 11:43:40,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:43:40,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671605285] [2022-01-31 11:43:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:43:40,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:43:40,052 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:43:40,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [260779628] [2022-01-31 11:43:40,053 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:43:40,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:43:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:43:40,054 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:43:40,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-01-31 11:43:40,239 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 11:43:40,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:43:40,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:43:40,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:43:40,345 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:43:40,401 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:43:40,402 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 30 treesize of output 29 [2022-01-31 11:43:40,431 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:43:40,432 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 30 treesize of output 29 [2022-01-31 11:43:40,474 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:43:40,474 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 30 treesize of output 29 [2022-01-31 11:43:40,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:43:40,559 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 21 treesize of output 23 [2022-01-31 11:43:40,590 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:43:40,591 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 26 treesize of output 26 [2022-01-31 11:43:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 53 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:43:40,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:43:40,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_1497 (Array Int Int))) (let ((.cse0 (+ main_~i~0 4))) (or (< .cse0 c_~N~0) (< c_~N~0 .cse0) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4)))) is different from false [2022-01-31 11:43:41,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 4 v_main_~i~0_457) c_main_~i~0) (< c_main_~i~0 (+ 3 v_main_~i~0_457)) (= (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_1496)) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4))) is different from false [2022-01-31 11:43:41,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (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 4) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))) is different from false [2022-01-31 11:43:41,035 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_1493) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))) is different from false [2022-01-31 11:43:41,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) is different from false [2022-01-31 11:43:41,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_1491) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) is different from false [2022-01-31 11:43:41,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ v_main_~i~0_457 1) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_1491) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_1493) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 v_main_~i~0_457))) is different from false [2022-01-31 11:43:41,229 INFO L353 Elim1Store]: treesize reduction 293, result has 15.6 percent of original size [2022-01-31 11:43:41,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 72 [2022-01-31 11:43:41,236 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-01-31 11:43:41,236 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 44 treesize of output 32 [2022-01-31 11:43:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 37 not checked. [2022-01-31 11:43:41,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:43:41,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671605285] [2022-01-31 11:43:41,283 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:43:41,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260779628] [2022-01-31 11:43:41,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260779628] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:43:41,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:43:41,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 32 [2022-01-31 11:43:41,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418991633] [2022-01-31 11:43:41,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:43:41,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 11:43:41,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:43:41,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 11:43:41,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=510, Unknown=17, NotChecked=364, Total=992 [2022-01-31 11:43:41,285 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 32 states, 32 states have (on average 2.34375) internal successors, (75), 32 states have internal predecessors, (75), 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 11:43:42,683 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ v_main_~i~0_457 1) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_1491) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_1493) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 v_main_~i~0_457))) (= (+ (- 3) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1)) is different from false [2022-01-31 11:43:43,870 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 (- 4)))) 1) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_1491) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|)) is different from false [2022-01-31 11:43:45,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1491) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= |c_main_#t~mem8| (select .cse0 (+ .cse1 c_main_~a~0.offset))))) is different from false [2022-01-31 11:43:46,992 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ v_main_~i~0_457 1) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_1491) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_1493) (+ .cse3 c_main_~a~0.offset 12) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 v_main_~i~0_457))) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:43:48,435 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1491) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset) v_ArrVal_1493) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))))) is different from false [2022-01-31 11:43:50,284 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1491) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= |c_main_#t~mem8| (select .cse0 (+ .cse1 c_main_~a~0.offset))) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset) v_ArrVal_1493) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))))) is different from false [2022-01-31 11:43:52,291 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (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 4) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ v_main_~i~0_457 1) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_1491) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_1493) (+ .cse3 c_main_~a~0.offset 12) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 v_main_~i~0_457))) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:43:54,297 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1491) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 4 v_main_~i~0_457) c_main_~i~0) (< c_main_~i~0 (+ 3 v_main_~i~0_457)) (= (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_1496)) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4))) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 12)))) 1) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset) v_ArrVal_1493) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))))) is different from false [2022-01-31 11:43:56,305 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1491) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (< c_main_~i~0 c_~N~0) (= |c_main_#t~mem8| (select .cse0 (+ .cse1 c_main_~a~0.offset))) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 12)))) 1) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset) v_ArrVal_1493) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))))) is different from false [2022-01-31 11:43:58,313 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (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 4) v_ArrVal_1496)) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (< c_main_~i~0 c_~N~0) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 12)))) 1) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ v_main_~i~0_457 1) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_1491) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_1493) (+ .cse3 c_main_~a~0.offset 12) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 v_main_~i~0_457))) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:44:00,321 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (* c_main_~i~0 4))) (and (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 4)))) 1) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_1491 Int) (v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (< c_main_~i~0 (+ v_main_~i~0_457 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1491) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_1493) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (<= (+ 2 v_main_~i~0_457) c_main_~i~0))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 4 v_main_~i~0_457) c_main_~i~0) (< c_main_~i~0 (+ 3 v_main_~i~0_457)) (= (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_1496)) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4))) (= (+ (- 3) (select .cse0 (+ .cse1 c_main_~a~0.offset (- 12)))) 1) (forall ((v_ArrVal_1493 Int) (v_ArrVal_1496 Int) (v_ArrVal_1497 (Array Int Int)) (v_main_~i~0_457 Int)) (or (<= (+ 3 v_main_~i~0_457) c_main_~i~0) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset) v_ArrVal_1493) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_1496))) |c_main_~#sum~0.base| v_ArrVal_1497) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457))) 4) (< c_main_~i~0 (+ 2 v_main_~i~0_457)))) (exists ((v_main_~i~0_445 Int)) (and (<= c_main_~i~0 (+ v_main_~i~0_445 1)) (= (+ (- 3) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_445) c_main_~a~0.offset (- 12)))) 1) (< v_main_~i~0_445 c_~N~0))))) is different from false [2022-01-31 11:44:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:02,537 INFO L93 Difference]: Finished difference Result 165 states and 202 transitions. [2022-01-31 11:44:02,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 11:44:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.34375) internal successors, (75), 32 states have internal predecessors, (75), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-01-31 11:44:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:02,538 INFO L225 Difference]: With dead ends: 165 [2022-01-31 11:44:02,538 INFO L226 Difference]: Without dead ends: 165 [2022-01-31 11:44:02,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 18 IntricatePredicates, 1 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=151, Invalid=649, Unknown=28, NotChecked=1242, Total=2070 [2022-01-31 11:44:02,539 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:02,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 349 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 219 Invalid, 0 Unknown, 267 Unchecked, 0.1s Time] [2022-01-31 11:44:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-01-31 11:44:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2022-01-31 11:44:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 150 states have internal predecessors, (187), 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 11:44:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2022-01-31 11:44:02,541 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 63 [2022-01-31 11:44:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:02,542 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2022-01-31 11:44:02,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.34375) internal successors, (75), 32 states have internal predecessors, (75), 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 11:44:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2022-01-31 11:44:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:44:02,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:02,542 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:44:02,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-01-31 11:44:02,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-31 11:44:02,743 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1526356927, now seen corresponding path program 13 times [2022-01-31 11:44:02,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:02,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314678386] [2022-01-31 11:44:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:02,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:02,779 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:44:02,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481525657] [2022-01-31 11:44:02,780 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:44:02,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:02,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:02,781 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:44:02,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-01-31 11:44:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:02,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-31 11:44:02,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:02,909 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 11:44:03,009 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 37 treesize of output 17 [2022-01-31 11:44:03,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:03,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:44:03,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:03,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:44:03,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:03,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:44:03,166 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 11:44:03,192 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 17 treesize of output 9 [2022-01-31 11:44:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-31 11:44:03,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:03,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 11:44:03,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 11:44:03,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (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_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 3)) 1)) is different from false [2022-01-31 11:44:03,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_481 Int)) (or (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (Array Int Int))) (= (+ (- 3) (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_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_481)))) is different from false [2022-01-31 11:44:03,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1) (not (<= (+ c_main_~i~0 1) v_main_~i~0_481)))) is different from false [2022-01-31 11:44:03,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_482 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_482)) (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))))) is different from false [2022-01-31 11:44:03,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_main_~i~0_482 Int) (v_ArrVal_1577 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1577) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1) (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_482)))) is different from false [2022-01-31 11:44:03,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_483 Int)) (or (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_main_~i~0_482 Int) (v_ArrVal_1577 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (not (<= (+ v_main_~i~0_483 1) v_main_~i~0_482)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_483)) v_ArrVal_1577) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_483)))) is different from false [2022-01-31 11:44:03,601 INFO L353 Elim1Store]: treesize reduction 267, result has 16.0 percent of original size [2022-01-31 11:44:03,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 69 [2022-01-31 11:44:03,607 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:03,607 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 44 treesize of output 44 [2022-01-31 11:44:03,609 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 13 treesize of output 9 [2022-01-31 11:44:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 35 not checked. [2022-01-31 11:44:03,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:03,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314678386] [2022-01-31 11:44:03,686 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:44:03,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481525657] [2022-01-31 11:44:03,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481525657] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:03,686 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:44:03,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2022-01-31 11:44:03,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379758603] [2022-01-31 11:44:03,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:03,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 11:44:03,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 11:44:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=342, Unknown=8, NotChecked=360, Total=812 [2022-01-31 11:44:03,688 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 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 11:44:05,744 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_483 Int)) (or (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_main_~i~0_482 Int) (v_ArrVal_1577 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (not (<= (+ v_main_~i~0_483 1) v_main_~i~0_482)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_483)) v_ArrVal_1577) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_483)))) (= c_main_~i~0 1) (= (+ (- 3) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1)) is different from false [2022-01-31 11:44:07,771 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 3)) 1) (forall ((v_main_~i~0_483 Int)) (or (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_main_~i~0_482 Int) (v_ArrVal_1577 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (not (<= (+ v_main_~i~0_483 1) v_main_~i~0_482)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_483)) v_ArrVal_1577) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_483)))) (forall ((v_main_~i~0_482 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_482)) (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)))))) is different from false [2022-01-31 11:44:09,805 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_481 Int)) (or (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (Array Int Int))) (= (+ (- 3) (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_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_481)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 3)) 1) (forall ((v_main_~i~0_483 Int)) (or (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_main_~i~0_482 Int) (v_ArrVal_1577 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (not (<= (+ v_main_~i~0_483 1) v_main_~i~0_482)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_483)) v_ArrVal_1577) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_483)))) (forall ((v_main_~i~0_482 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_482)) (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))))) (<= 3 c_main_~i~0)) is different from false [2022-01-31 11:44:11,844 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1582 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) (forall ((v_main_~i~0_481 Int)) (or (forall ((v_ArrVal_1580 Int) (v_ArrVal_1582 (Array Int Int))) (= (+ (- 3) (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_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_481)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 4 c_main_~i~0) (= c_main_~a~0.offset 0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 3)) 1) (forall ((v_main_~i~0_483 Int)) (or (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_main_~i~0_482 Int) (v_ArrVal_1577 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (not (<= (+ v_main_~i~0_483 1) v_main_~i~0_482)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_483)) v_ArrVal_1577) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_483)))) (forall ((v_main_~i~0_482 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_482)) (forall ((v_ArrVal_1580 Int) (v_main_~i~0_481 Int) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1579 Int)) (or (not (<= (+ v_main_~i~0_482 1) v_main_~i~0_481)) (= (+ (- 3) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_482) c_main_~a~0.offset) v_ArrVal_1579) (+ c_main_~a~0.offset (* 4 v_main_~i~0_481)) v_ArrVal_1580)) |c_main_~#sum~0.base| v_ArrVal_1582) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)))))) is different from false [2022-01-31 11:44:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:12,046 INFO L93 Difference]: Finished difference Result 146 states and 173 transitions. [2022-01-31 11:44:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:44:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-01-31 11:44:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:12,046 INFO L225 Difference]: With dead ends: 146 [2022-01-31 11:44:12,046 INFO L226 Difference]: Without dead ends: 146 [2022-01-31 11:44:12,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=121, Invalid=377, Unknown=12, NotChecked=612, Total=1122 [2022-01-31 11:44:12,047 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:12,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 254 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 455 Invalid, 0 Unknown, 373 Unchecked, 0.2s Time] [2022-01-31 11:44:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-31 11:44:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2022-01-31 11:44:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 132 states have (on average 1.2121212121212122) internal successors, (160), 132 states have internal predecessors, (160), 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 11:44:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2022-01-31 11:44:12,049 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 63 [2022-01-31 11:44:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:12,050 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2022-01-31 11:44:12,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 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 11:44:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2022-01-31 11:44:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:44:12,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:12,050 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:44:12,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-01-31 11:44:12,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:12,271 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash -381650687, now seen corresponding path program 14 times [2022-01-31 11:44:12,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:12,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546842378] [2022-01-31 11:44:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:12,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:12,281 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:44:12,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593048194] [2022-01-31 11:44:12,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:44:12,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:12,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:12,282 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:44:12,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-01-31 11:44:12,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:44:12,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:12,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 11:44:12,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:12,562 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:44:12,630 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:44:12,630 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 11:44:12,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:12,702 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 11:44:12,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:12,749 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 11:44:12,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:12,793 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 11:44:12,830 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 11:44:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 11:44:12,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:12,909 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1663 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 11:44:12,915 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1663 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:44:12,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1663 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:44:12,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1663 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 11:44:12,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1663 (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_1660)) |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 11:44:12,958 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_506 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_506)) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1663 (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) (+ (* 4 v_main_~i~0_506) c_main_~a~0.offset) v_ArrVal_1660)) |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)))) is different from false [2022-01-31 11:44:14,568 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:44:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-01-31 11:44:14,573 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:14,573 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 11:44:14,575 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 11:44:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 35 not checked. [2022-01-31 11:44:14,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:14,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546842378] [2022-01-31 11:44:14,729 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:44:14,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593048194] [2022-01-31 11:44:14,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593048194] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:14,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:44:14,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-01-31 11:44:14,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109363455] [2022-01-31 11:44:14,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:14,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 11:44:14,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:14,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 11:44:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=505, Unknown=6, NotChecked=306, Total=930 [2022-01-31 11:44:14,730 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 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 11:44:16,864 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_506 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_506)) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1663 (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) (+ (* 4 v_main_~i~0_506) c_main_~a~0.offset) v_ArrVal_1660)) |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 4) (= 2 (+ (- 1) c_main_~i~0))) is different from false [2022-01-31 11:44:18,901 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_506 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_506)) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1663 (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) (+ (* 4 v_main_~i~0_506) c_main_~a~0.offset) v_ArrVal_1660)) |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= 4 c_main_~i~0) (forall ((v_ArrVal_1663 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1663) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 11:44:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:19,241 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2022-01-31 11:44:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 11:44:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-01-31 11:44:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:19,242 INFO L225 Difference]: With dead ends: 193 [2022-01-31 11:44:19,242 INFO L226 Difference]: Without dead ends: 193 [2022-01-31 11:44:19,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=142, Invalid=638, Unknown=8, NotChecked=472, Total=1260 [2022-01-31 11:44:19,243 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:19,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 277 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 611 Invalid, 0 Unknown, 388 Unchecked, 0.3s Time] [2022-01-31 11:44:19,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-31 11:44:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 174. [2022-01-31 11:44:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.221556886227545) internal successors, (204), 167 states have internal predecessors, (204), 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 11:44:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2022-01-31 11:44:19,246 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 63 [2022-01-31 11:44:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:19,246 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2022-01-31 11:44:19,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 31 states have internal predecessors, (80), 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 11:44:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2022-01-31 11:44:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:44:19,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:19,246 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:44:19,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-01-31 11:44:19,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:19,447 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1415300672, now seen corresponding path program 15 times [2022-01-31 11:44:19,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:19,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263008634] [2022-01-31 11:44:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:19,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:19,457 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:44:19,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995091011] [2022-01-31 11:44:19,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:44:19,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:19,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:19,458 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:44:19,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-01-31 11:44:19,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 11:44:19,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:19,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-31 11:44:19,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:44:19,824 INFO L353 Elim1Store]: treesize reduction 59, result has 16.9 percent of original size [2022-01-31 11:44:19,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 34 [2022-01-31 11:44:19,930 INFO L353 Elim1Store]: treesize reduction 134, result has 15.7 percent of original size [2022-01-31 11:44:19,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 51 [2022-01-31 11:44:20,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:20,114 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 46 treesize of output 44 [2022-01-31 11:44:20,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:20,180 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 46 treesize of output 44 [2022-01-31 11:44:20,259 INFO L353 Elim1Store]: treesize reduction 62, result has 39.8 percent of original size [2022-01-31 11:44:20,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 57 [2022-01-31 11:44:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 35 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-31 11:44:20,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:20,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1745 (Array Int Int)) (main_~i~0 Int)) (or (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1745) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (not (< (+ main_~i~0 2) c_~N~0)) (< (+ main_~i~0 3) c_~N~0))) is different from false [2022-01-31 11:44:27,549 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:44:27,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 253 treesize of output 226 [2022-01-31 11:44:27,554 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 147 treesize of output 143 [2022-01-31 11:44:27,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:27,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:27,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:27,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:27,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:27,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:27,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:44:27,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 23 [2022-01-31 11:44:27,569 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 9 treesize of output 3 [2022-01-31 11:44:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 23 trivial. 18 not checked. [2022-01-31 11:44:27,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263008634] [2022-01-31 11:44:27,752 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:44:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995091011] [2022-01-31 11:44:27,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995091011] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:44:27,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:44:27,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2022-01-31 11:44:27,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399696211] [2022-01-31 11:44:27,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:44:27,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-31 11:44:27,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:44:27,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-31 11:44:27,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1218, Unknown=10, NotChecked=74, Total=1560 [2022-01-31 11:44:27,753 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 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 11:44:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:44:28,407 INFO L93 Difference]: Finished difference Result 215 states and 260 transitions. [2022-01-31 11:44:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:44:28,409 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-01-31 11:44:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:44:28,409 INFO L225 Difference]: With dead ends: 215 [2022-01-31 11:44:28,409 INFO L226 Difference]: Without dead ends: 215 [2022-01-31 11:44:28,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=460, Invalid=1984, Unknown=10, NotChecked=96, Total=2550 [2022-01-31 11:44:28,410 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:44:28,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 303 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 227 Invalid, 0 Unknown, 272 Unchecked, 0.2s Time] [2022-01-31 11:44:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-01-31 11:44:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2022-01-31 11:44:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 192 states have (on average 1.2239583333333333) internal successors, (235), 192 states have internal predecessors, (235), 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 11:44:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 241 transitions. [2022-01-31 11:44:28,413 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 241 transitions. Word has length 63 [2022-01-31 11:44:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:44:28,413 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 241 transitions. [2022-01-31 11:44:28,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 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 11:44:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 241 transitions. [2022-01-31 11:44:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:44:28,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:44:28,414 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:44:28,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-01-31 11:44:28,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-01-31 11:44:28,621 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:44:28,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:44:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1920859297, now seen corresponding path program 8 times [2022-01-31 11:44:28,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:44:28,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73187226] [2022-01-31 11:44:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:44:28,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:44:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:29,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:44:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:29,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:44:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:44:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 11:44:29,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:44:29,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73187226] [2022-01-31 11:44:29,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73187226] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:44:29,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42659715] [2022-01-31 11:44:29,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:44:29,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:44:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:44:29,403 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:44:29,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-01-31 11:44:29,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:44:29,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:44:29,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 74 conjunts are in the unsatisfiable core [2022-01-31 11:44:29,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:44:29,589 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 11:44:29,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:29,652 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 11:44:29,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:29,721 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 11:44:29,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:29,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:44:29,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:29,860 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 11:44:29,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:29,931 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 11:44:30,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,107 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 11:44:30,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,128 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 11:44:30,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,148 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 11:44:30,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,197 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 11:44:30,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,214 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 11:44:30,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,296 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 11:44:30,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,423 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:44:30,423 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 11:44:30,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,645 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:44:30,646 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 11:44:30,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:30,873 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:44:30,873 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 11:44:31,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:31,067 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:44:31,067 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 61 treesize of output 43 [2022-01-31 11:44:31,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:44:31,224 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:44:31,224 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 45 treesize of output 17 [2022-01-31 11:44:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:44:31,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:45:34,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_1831 (Array Int Int)) (v_main_~i~0_561 Int) (main_~a~0.offset Int) (v_main_~i~0_559 Int) (v_main_~i~0_557 Int) (v_main_~i~0_555 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1831))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse7 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_1831 (+ main_~a~0.offset (* main_~i~0 4))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_561))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_559))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_557))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_555))))) (or (not (= .cse0 4)) (= (+ .cse1 .cse2 .cse3 .cse4 .cse0 .cse5) (* c_~N~0 4)) (not (= .cse1 4)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= 4 .cse5))))))))))) is different from false [2022-01-31 11:45:54,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_1831 (Array Int Int)) (v_main_~i~0_561 Int) (v_main_~i~0_570 Int) (main_~a~0.offset Int) (v_main_~i~0_559 Int) (v_main_~i~0_557 Int) (v_main_~i~0_555 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1831))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_1831 (+ main_~a~0.offset (* 4 v_main_~i~0_570))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_561))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_559))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_557))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_555))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (= .cse2 4)) (not (= 4 .cse4)) (not (= .cse0 4)) (not (= 4 .cse5)) (not (= .cse3 4))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:45:57,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int)) (v_main_~i~0_561 Int) (~N~0 Int) (v_main_~i~0_570 Int) (main_~a~0.offset Int) (v_main_~i~0_559 Int) (v_main_~i~0_557 Int) (v_main_~i~0_555 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1831))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_1831 (+ main_~a~0.offset (* 4 v_main_~i~0_570))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_561))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_559))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_557))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_555))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (= .cse2 4)) (not (= 4 .cse4)) (not (= .cse0 4)) (not (= 4 .cse5)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0) (not (= .cse3 4))))))))))) is different from false [2022-01-31 11:46:04,806 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int)) (v_main_~i~0_561 Int) (~N~0 Int) (v_main_~i~0_570 Int) (main_~a~0.offset Int) (v_main_~i~0_559 Int) (v_main_~i~0_557 Int) (v_main_~i~0_555 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1831))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_1831 (+ main_~a~0.offset (* 4 v_main_~i~0_570))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_561))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_559))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_557))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_555))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (= .cse2 4)) (< (+ c_main_~i~0 3) ~N~0) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 4 .cse4)) (not (= .cse0 4)) (not (= 4 .cse5)) (not (= .cse3 4))))))))))) is different from false [2022-01-31 11:46:11,834 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int)) (v_main_~i~0_561 Int) (~N~0 Int) (v_main_~i~0_570 Int) (main_~a~0.offset Int) (v_main_~i~0_559 Int) (v_main_~i~0_557 Int) (v_main_~i~0_555 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1831))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_1831 (+ main_~a~0.offset (* 4 v_main_~i~0_570))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_561))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_559))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_557))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_555))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (= .cse2 4)) (< (+ c_main_~i~0 4) ~N~0) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= 4 .cse4)) (not (= .cse0 4)) (not (= 4 .cse5)) (not (= .cse3 4))))))))))) is different from false [2022-01-31 11:46:19,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int)) (v_main_~i~0_561 Int) (~N~0 Int) (v_main_~i~0_570 Int) (main_~a~0.offset Int) (v_main_~i~0_559 Int) (v_main_~i~0_557 Int) (v_main_~i~0_555 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1831))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse7 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_1831 (+ main_~a~0.offset (* 4 v_main_~i~0_570))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_561))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_559))))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_557))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_555))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (= .cse2 4)) (< (+ c_main_~i~0 5) ~N~0) (not (= 4 .cse4)) (not (= .cse0 4)) (not (< (+ c_main_~i~0 4) ~N~0)) (not (= 4 .cse5)) (not (= .cse3 4))))))))))) is different from false [2022-01-31 11:46:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 26 trivial. 34 not checked. [2022-01-31 11:46:23,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42659715] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:46:23,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:46:23,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23, 24] total 68 [2022-01-31 11:46:23,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171229547] [2022-01-31 11:46:23,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:46:23,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-31 11:46:23,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:46:23,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-31 11:46:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3546, Unknown=34, NotChecked=750, Total=4556 [2022-01-31 11:46:23,409 INFO L87 Difference]: Start difference. First operand 199 states and 241 transitions. Second operand has 68 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 65 states have internal predecessors, (118), 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 11:46:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:46:34,831 INFO L93 Difference]: Finished difference Result 272 states and 327 transitions. [2022-01-31 11:46:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 11:46:34,832 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 65 states have internal predecessors, (118), 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 63 [2022-01-31 11:46:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:46:34,833 INFO L225 Difference]: With dead ends: 272 [2022-01-31 11:46:34,833 INFO L226 Difference]: Without dead ends: 268 [2022-01-31 11:46:34,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 99 SyntacticMatches, 14 SemanticMatches, 83 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1788 ImplicationChecksByTransitivity, 67.5s TimeCoverageRelationStatistics Valid=434, Invalid=5718, Unknown=34, NotChecked=954, Total=7140 [2022-01-31 11:46:34,834 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 67 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1019 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:46:34,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 328 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 935 Invalid, 0 Unknown, 1019 Unchecked, 0.6s Time] [2022-01-31 11:46:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-01-31 11:46:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 263. [2022-01-31 11:46:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 256 states have (on average 1.21484375) internal successors, (311), 256 states have internal predecessors, (311), 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 11:46:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 317 transitions. [2022-01-31 11:46:34,837 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 317 transitions. Word has length 63 [2022-01-31 11:46:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:46:34,837 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 317 transitions. [2022-01-31 11:46:34,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 65 states have internal predecessors, (118), 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 11:46:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 317 transitions. [2022-01-31 11:46:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:46:34,838 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:46:34,838 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:46:34,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-01-31 11:46:35,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:46:35,046 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:46:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:46:35,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1586460289, now seen corresponding path program 6 times [2022-01-31 11:46:35,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:46:35,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590901204] [2022-01-31 11:46:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:46:35,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:46:35,061 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:46:35,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160983121] [2022-01-31 11:46:35,061 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:46:35,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:46:35,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:46:35,063 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:46:35,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-01-31 11:46:35,270 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 11:46:35,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:46:35,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-31 11:46:35,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:46:35,317 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 11:46:35,441 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 11:46:35,441 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 27 treesize of output 26 [2022-01-31 11:46:35,501 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 11:46:35,501 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 27 treesize of output 34 [2022-01-31 11:46:35,688 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 11:46:35,689 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 27 treesize of output 34 [2022-01-31 11:46:35,847 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 11:46:35,847 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 33 treesize of output 40 [2022-01-31 11:46:35,989 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:46:35,989 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 29 treesize of output 29 [2022-01-31 11:46:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-31 11:46:36,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:46:37,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_592 Int) (v_ArrVal_1921 Int)) (or (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1921) (+ c_main_~a~0.offset (* 4 v_main_~i~0_592))) 1) (not (< v_main_~i~0_592 c_~N~0)) (< v_main_~i~0_592 (+ main_~i~0 3)) (< (+ v_main_~i~0_592 1) c_~N~0))) is different from false [2022-01-31 11:46:39,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_596 Int) (v_ArrVal_1919 Int) (v_main_~i~0_592 Int) (v_ArrVal_1921 Int)) (or (< v_main_~i~0_592 (+ 3 v_main_~i~0_596)) (not (< v_main_~i~0_592 c_~N~0)) (< (+ v_main_~i~0_592 1) c_~N~0) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1919) (+ c_main_~a~0.offset (* 4 v_main_~i~0_596)) v_ArrVal_1921) (+ c_main_~a~0.offset (* 4 v_main_~i~0_592))) 1))) is different from false [2022-01-31 11:46:41,746 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_597 Int)) (or (forall ((v_main_~i~0_596 Int) (v_ArrVal_1919 Int) (v_main_~i~0_592 Int) (v_ArrVal_1921 Int)) (or (< v_main_~i~0_592 (+ 3 v_main_~i~0_596)) (not (< v_main_~i~0_592 c_~N~0)) (< (+ v_main_~i~0_592 1) c_~N~0) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_597)) v_ArrVal_1919) (+ c_main_~a~0.offset (* 4 v_main_~i~0_596)) v_ArrVal_1921) (+ c_main_~a~0.offset (* 4 v_main_~i~0_592))) 1))) (not (<= v_main_~i~0_597 0)))) is different from false [2022-01-31 11:46:50,199 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 32 treesize of output 30 [2022-01-31 11:46:50,202 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 442 treesize of output 430 [2022-01-31 11:46:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 35 trivial. 20 not checked. [2022-01-31 11:46:50,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:46:50,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590901204] [2022-01-31 11:46:50,346 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:46:50,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160983121] [2022-01-31 11:46:50,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160983121] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:46:50,346 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:46:50,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2022-01-31 11:46:50,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427163170] [2022-01-31 11:46:50,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:46:50,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 11:46:50,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:46:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 11:46:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=739, Unknown=7, NotChecked=180, Total=1122 [2022-01-31 11:46:50,347 INFO L87 Difference]: Start difference. First operand 263 states and 317 transitions. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 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 11:47:16,447 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_597 Int)) (or (forall ((v_main_~i~0_596 Int) (v_ArrVal_1919 Int) (v_main_~i~0_592 Int) (v_ArrVal_1921 Int)) (or (< v_main_~i~0_592 (+ 3 v_main_~i~0_596)) (not (< v_main_~i~0_592 c_~N~0)) (< (+ v_main_~i~0_592 1) c_~N~0) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_597)) v_ArrVal_1919) (+ c_main_~a~0.offset (* 4 v_main_~i~0_596)) v_ArrVal_1921) (+ c_main_~a~0.offset (* 4 v_main_~i~0_592))) 1))) (not (<= v_main_~i~0_597 0)))) (exists ((v_main_~i~0_580 Int)) (and (<= 4 v_main_~i~0_580) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_580))) 1) (<= c_~N~0 (+ v_main_~i~0_580 1)) (< v_main_~i~0_580 c_~N~0)))) is different from false [2022-01-31 11:47:16,973 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_596 Int) (v_ArrVal_1919 Int) (v_main_~i~0_592 Int) (v_ArrVal_1921 Int)) (or (< v_main_~i~0_592 (+ 3 v_main_~i~0_596)) (not (< v_main_~i~0_592 c_~N~0)) (< (+ v_main_~i~0_592 1) c_~N~0) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1919) (+ c_main_~a~0.offset (* 4 v_main_~i~0_596)) v_ArrVal_1921) (+ c_main_~a~0.offset (* 4 v_main_~i~0_592))) 1))) (<= c_main_~i~0 0) (exists ((v_main_~i~0_580 Int)) (and (<= 4 v_main_~i~0_580) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_580))) 1) (<= c_~N~0 (+ v_main_~i~0_580 1)) (< v_main_~i~0_580 c_~N~0)))) is different from false [2022-01-31 11:47:17,673 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_580 Int)) (and (<= 4 v_main_~i~0_580) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_580))) 1) (<= c_~N~0 (+ v_main_~i~0_580 1)) (< v_main_~i~0_580 c_~N~0))) (forall ((main_~i~0 Int) (v_main_~i~0_592 Int) (v_ArrVal_1921 Int)) (or (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1921) (+ c_main_~a~0.offset (* 4 v_main_~i~0_592))) 1) (not (< v_main_~i~0_592 c_~N~0)) (< v_main_~i~0_592 (+ main_~i~0 3)) (< (+ v_main_~i~0_592 1) c_~N~0)))) is different from false [2022-01-31 11:47:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:42,057 INFO L93 Difference]: Finished difference Result 265 states and 322 transitions. [2022-01-31 11:47:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 11:47:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-01-31 11:47:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:42,058 INFO L225 Difference]: With dead ends: 265 [2022-01-31 11:47:42,058 INFO L226 Difference]: Without dead ends: 265 [2022-01-31 11:47:42,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=426, Invalid=1633, Unknown=35, NotChecked=558, Total=2652 [2022-01-31 11:47:42,059 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:42,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 236 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 198 Invalid, 0 Unknown, 288 Unchecked, 0.1s Time] [2022-01-31 11:47:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-01-31 11:47:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 248. [2022-01-31 11:47:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 241 states have (on average 1.2199170124481329) internal successors, (294), 241 states have internal predecessors, (294), 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 11:47:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 300 transitions. [2022-01-31 11:47:42,062 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 300 transitions. Word has length 63 [2022-01-31 11:47:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:42,062 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 300 transitions. [2022-01-31 11:47:42,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 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 11:47:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 300 transitions. [2022-01-31 11:47:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 11:47:42,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:42,063 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:42,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:42,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:42,263 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1281288795, now seen corresponding path program 9 times [2022-01-31 11:47:42,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:42,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183902453] [2022-01-31 11:47:42,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:42,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:47:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:47:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:47:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:47:42,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:42,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183902453] [2022-01-31 11:47:42,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183902453] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:47:42,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201422620] [2022-01-31 11:47:42,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:47:42,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:42,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:42,469 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:42,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-01-31 11:47:42,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 11:47:42,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:42,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 11:47:42,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:47:42,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:47:43,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201422620] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:43,078 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:47:43,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 11:47:43,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71953286] [2022-01-31 11:47:43,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:43,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 11:47:43,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:43,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 11:47:43,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 11:47:43,079 INFO L87 Difference]: Start difference. First operand 248 states and 300 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:43,663 INFO L93 Difference]: Finished difference Result 294 states and 360 transitions. [2022-01-31 11:47:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:47:43,667 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2022-01-31 11:47:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:43,668 INFO L225 Difference]: With dead ends: 294 [2022-01-31 11:47:43,668 INFO L226 Difference]: Without dead ends: 294 [2022-01-31 11:47:43,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 11:47:43,669 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 175 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:43,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 62 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 11:47:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-01-31 11:47:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 212. [2022-01-31 11:47:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 205 states have (on average 1.224390243902439) internal successors, (251), 205 states have internal predecessors, (251), 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 11:47:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 257 transitions. [2022-01-31 11:47:43,683 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 257 transitions. Word has length 65 [2022-01-31 11:47:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:43,683 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 257 transitions. [2022-01-31 11:47:43,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 257 transitions. [2022-01-31 11:47:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 11:47:43,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:43,684 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 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 11:47:43,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-01-31 11:47:43,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-01-31 11:47:43,891 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1829869966, now seen corresponding path program 16 times [2022-01-31 11:47:43,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:43,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126040761] [2022-01-31 11:47:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:43,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:43,902 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:43,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964140014] [2022-01-31 11:47:43,902 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:47:43,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:43,903 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:43,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-01-31 11:47:44,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:47:44,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:44,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 11:47:44,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:47:44,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:47:44,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:44,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126040761] [2022-01-31 11:47:44,394 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:44,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964140014] [2022-01-31 11:47:44,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964140014] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:44,394 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:44,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-01-31 11:47:44,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344997309] [2022-01-31 11:47:44,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:44,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:47:44,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:44,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:47:44,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:47:44,395 INFO L87 Difference]: Start difference. First operand 212 states and 257 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:44,643 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2022-01-31 11:47:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:47:44,643 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2022-01-31 11:47:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:44,644 INFO L225 Difference]: With dead ends: 249 [2022-01-31 11:47:44,644 INFO L226 Difference]: Without dead ends: 205 [2022-01-31 11:47:44,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-01-31 11:47:44,644 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 194 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:44,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 78 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:47:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-01-31 11:47:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 174. [2022-01-31 11:47:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.251497005988024) internal successors, (209), 167 states have internal predecessors, (209), 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 11:47:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2022-01-31 11:47:44,647 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 66 [2022-01-31 11:47:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:44,647 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2022-01-31 11:47:44,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:47:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2022-01-31 11:47:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:47:44,648 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:44,648 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:47:44,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:44,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-01-31 11:47:44,865 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:44,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash -495380602, now seen corresponding path program 17 times [2022-01-31 11:47:44,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:44,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380218387] [2022-01-31 11:47:44,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:44,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:44,875 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:44,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681518949] [2022-01-31 11:47:44,875 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:47:44,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:44,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:44,876 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:44,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-01-31 11:47:45,360 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-31 11:47:45,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:45,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-31 11:47:45,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:45,377 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 11:47:45,481 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 31 treesize of output 15 [2022-01-31 11:47:45,518 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 11:47:45,543 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 11:47:45,569 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 11:47:45,594 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 11:47:45,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 18 treesize of output 20 [2022-01-31 11:47:45,644 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 21 treesize of output 9 [2022-01-31 11:47:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 11 proven. 91 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-31 11:47:45,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:45,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2175) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 11:47:45,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2175) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:47:45,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2175) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 4)) is different from false [2022-01-31 11:47:45,745 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2175) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)))) is different from false [2022-01-31 11:47:45,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2175) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 20)) 4)) is different from false [2022-01-31 11:47:45,762 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2175) c_main_~a~0.base) (+ c_main_~a~0.offset 20)) 4)) is different from false [2022-01-31 11:47:45,805 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:45,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-01-31 11:47:45,810 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:45,810 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 11:47:45,812 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 11:47:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 36 trivial. 51 not checked. [2022-01-31 11:47:45,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:45,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380218387] [2022-01-31 11:47:45,900 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:45,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681518949] [2022-01-31 11:47:45,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681518949] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:45,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:45,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2022-01-31 11:47:45,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748650310] [2022-01-31 11:47:45,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:45,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:47:45,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:45,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:47:45,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=393, Unknown=6, NotChecked=270, Total=756 [2022-01-31 11:47:45,901 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 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 11:47:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:47:46,366 INFO L93 Difference]: Finished difference Result 336 states and 426 transitions. [2022-01-31 11:47:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:47:46,366 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2022-01-31 11:47:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:47:46,367 INFO L225 Difference]: With dead ends: 336 [2022-01-31 11:47:46,367 INFO L226 Difference]: Without dead ends: 336 [2022-01-31 11:47:46,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 113 SyntacticMatches, 16 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=505, Unknown=6, NotChecked=306, Total=930 [2022-01-31 11:47:46,368 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 93 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:47:46,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 276 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 722 Invalid, 0 Unknown, 621 Unchecked, 0.4s Time] [2022-01-31 11:47:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-01-31 11:47:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 210. [2022-01-31 11:47:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 203 states have internal predecessors, (253), 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 11:47:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 259 transitions. [2022-01-31 11:47:46,371 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 259 transitions. Word has length 71 [2022-01-31 11:47:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:47:46,371 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 259 transitions. [2022-01-31 11:47:46,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 28 states have internal predecessors, (76), 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 11:47:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2022-01-31 11:47:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:47:46,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:47:46,372 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 4, 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 11:47:46,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-01-31 11:47:46,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-01-31 11:47:46,590 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:47:46,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:47:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2056776359, now seen corresponding path program 18 times [2022-01-31 11:47:46,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:47:46,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765521561] [2022-01-31 11:47:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:47:46,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:47:46,600 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:47:46,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663097499] [2022-01-31 11:47:46,600 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:47:46,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:47:46,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:47:46,601 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:47:46,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-01-31 11:47:46,902 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 11:47:46,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:47:46,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 11:47:46,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:47:47,024 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:47:47,108 INFO L353 Elim1Store]: treesize reduction 59, result has 16.9 percent of original size [2022-01-31 11:47:47,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 32 [2022-01-31 11:47:47,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:47,277 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 32 treesize of output 32 [2022-01-31 11:47:47,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:47,351 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 32 treesize of output 32 [2022-01-31 11:47:47,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:47,405 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 32 treesize of output 32 [2022-01-31 11:47:47,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:47,457 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 32 treesize of output 32 [2022-01-31 11:47:47,521 INFO L353 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2022-01-31 11:47:47,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-01-31 11:47:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-31 11:47:47,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:47:47,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_2269 (Array Int Int))) (or (not (< (+ main_~i~0 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2269) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< (+ main_~i~0 2) c_~N~0))) is different from false [2022-01-31 11:47:49,742 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:47:49,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 104 [2022-01-31 11:47:49,747 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 83 treesize of output 79 [2022-01-31 11:47:49,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:47:49,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:47:49,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:47:49,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 19 [2022-01-31 11:47:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 73 trivial. 29 not checked. [2022-01-31 11:47:49,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:47:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765521561] [2022-01-31 11:47:49,850 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:47:49,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663097499] [2022-01-31 11:47:49,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663097499] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:47:49,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:47:49,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2022-01-31 11:47:49,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299157436] [2022-01-31 11:47:49,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:47:49,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:47:49,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:47:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:47:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=586, Unknown=6, NotChecked=50, Total=756 [2022-01-31 11:47:49,851 INFO L87 Difference]: Start difference. First operand 210 states and 259 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 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 11:48:09,957 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~i~0 Int) (v_ArrVal_2269 (Array Int Int))) (or (not (< (+ main_~i~0 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2269) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< (+ main_~i~0 2) c_~N~0))) (forall ((main_~i~0 Int)) (or (not (< (+ main_~i~0 1) c_~N~0)) (< (+ main_~i~0 2) c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4)))) is different from false [2022-01-31 11:48:09,961 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (< (+ c_main_~i~0 1) c_~N~0)) (= |c_main_#t~mem12| 4) (< (+ c_main_~i~0 2) c_~N~0)) (forall ((main_~i~0 Int) (v_ArrVal_2269 (Array Int Int))) (or (not (< (+ main_~i~0 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2269) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< (+ main_~i~0 2) c_~N~0)))) is different from false [2022-01-31 11:48:10,216 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (< (+ c_main_~i~0 1) c_~N~0)) (< (+ c_main_~i~0 2) c_~N~0)) (forall ((main_~i~0 Int) (v_ArrVal_2269 (Array Int Int))) (or (not (< (+ main_~i~0 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2269) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< (+ main_~i~0 2) c_~N~0)))) is different from false [2022-01-31 11:48:10,282 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~i~0 Int) (v_ArrVal_2269 (Array Int Int))) (or (not (< (+ main_~i~0 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2269) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< (+ main_~i~0 2) c_~N~0))) (or (not (< c_main_~i~0 c_~N~0)) (< (+ c_main_~i~0 1) c_~N~0))) is different from false [2022-01-31 11:48:10,287 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~i~0 Int) (v_ArrVal_2269 (Array Int Int))) (or (not (< (+ main_~i~0 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2269) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< (+ main_~i~0 2) c_~N~0))) (< (+ c_main_~i~0 1) c_~N~0)) is different from false [2022-01-31 11:48:10,291 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~i~0 Int) (v_ArrVal_2269 (Array Int Int))) (or (not (< (+ main_~i~0 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2269) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< (+ main_~i~0 2) c_~N~0))) (forall ((main_~i~0 Int)) (or (not (< (+ main_~i~0 1) c_~N~0)) (< (+ main_~i~0 2) c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4))) (< (+ c_main_~i~0 1) c_~N~0)) is different from false [2022-01-31 11:48:10,295 WARN L838 $PredicateComparison]: unable to prove that (and (< c_main_~i~0 c_~N~0) (forall ((main_~i~0 Int) (v_ArrVal_2269 (Array Int Int))) (or (not (< (+ main_~i~0 1) c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2269) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4) (< (+ main_~i~0 2) c_~N~0))) (forall ((main_~i~0 Int)) (or (not (< (+ main_~i~0 1) c_~N~0)) (< (+ main_~i~0 2) c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 4)))) is different from false [2022-01-31 11:48:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:48:10,298 INFO L93 Difference]: Finished difference Result 339 states and 424 transitions. [2022-01-31 11:48:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 11:48:10,298 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2022-01-31 11:48:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:48:10,299 INFO L225 Difference]: With dead ends: 339 [2022-01-31 11:48:10,299 INFO L226 Difference]: Without dead ends: 339 [2022-01-31 11:48:10,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=302, Invalid=1432, Unknown=20, NotChecked=696, Total=2450 [2022-01-31 11:48:10,300 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:48:10,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 236 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 185 Unchecked, 0.1s Time] [2022-01-31 11:48:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-01-31 11:48:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 292. [2022-01-31 11:48:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 285 states have (on average 1.2666666666666666) internal successors, (361), 285 states have internal predecessors, (361), 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 11:48:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 367 transitions. [2022-01-31 11:48:10,303 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 367 transitions. Word has length 71 [2022-01-31 11:48:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:48:10,304 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 367 transitions. [2022-01-31 11:48:10,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 28 states have internal predecessors, (66), 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 11:48:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 367 transitions. [2022-01-31 11:48:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:48:10,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:10,304 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:48:10,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-01-31 11:48:10,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:10,505 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:10,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:10,505 INFO L85 PathProgramCache]: Analyzing trace with hash -441239578, now seen corresponding path program 19 times [2022-01-31 11:48:10,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:10,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701388054] [2022-01-31 11:48:10,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:10,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:10,516 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:48:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490798955] [2022-01-31 11:48:10,516 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:48:10,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:10,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:48:10,517 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:48:10,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-01-31 11:48:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:10,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-31 11:48:10,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:48:10,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 11:48:10,766 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 37 treesize of output 17 [2022-01-31 11:48:10,826 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:48:10,826 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 11:48:10,859 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:48:10,860 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 11:48:10,895 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:48:10,895 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 11:48:10,954 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 11:48:10,991 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 11:48:11,026 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 11:48:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-31 11:48:11,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:48:11,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2367 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 4)) is different from false [2022-01-31 11:48:11,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2367 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:48:11,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2367 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:48:11,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2367 (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_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) is different from false [2022-01-31 11:48:11,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_734 Int)) (or (forall ((v_ArrVal_2364 Int) (v_ArrVal_2367 (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_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_734)))) is different from false [2022-01-31 11:48:11,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2362 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_734 Int)) (or (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4) (not (<= (+ c_main_~i~0 1) v_main_~i~0_734)))) is different from false [2022-01-31 11:48:11,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_735 Int)) (or (forall ((v_ArrVal_2362 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_734 Int)) (or (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_735)))) is different from false [2022-01-31 11:48:11,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2362 Int) (v_ArrVal_2361 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_735 Int) (v_main_~i~0_734 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_735)) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_2361) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4))) is different from false [2022-01-31 11:48:11,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_736 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_736)) (forall ((v_ArrVal_2362 Int) (v_ArrVal_2361 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_735 Int) (v_main_~i~0_734 Int)) (or (not (<= (+ v_main_~i~0_736 1) v_main_~i~0_735)) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)) (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_736)) v_ArrVal_2361) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))) is different from false [2022-01-31 11:48:11,569 INFO L353 Elim1Store]: treesize reduction 267, result has 16.0 percent of original size [2022-01-31 11:48:11,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 67 [2022-01-31 11:48:11,576 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:48:11,576 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 40 treesize of output 40 [2022-01-31 11:48:11,578 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 11:48:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 51 not checked. [2022-01-31 11:48:11,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:11,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701388054] [2022-01-31 11:48:11,650 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:48:11,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490798955] [2022-01-31 11:48:11,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490798955] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:48:11,650 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:48:11,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 29 [2022-01-31 11:48:11,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731591568] [2022-01-31 11:48:11,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:48:11,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 11:48:11,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:48:11,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 11:48:11,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=318, Unknown=9, NotChecked=396, Total=812 [2022-01-31 11:48:11,651 INFO L87 Difference]: Start difference. First operand 292 states and 367 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 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 11:48:13,743 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 2) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 4) (forall ((v_main_~i~0_736 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_736)) (forall ((v_ArrVal_2362 Int) (v_ArrVal_2361 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_735 Int) (v_main_~i~0_734 Int)) (or (not (<= (+ v_main_~i~0_736 1) v_main_~i~0_735)) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)) (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_736)) v_ArrVal_2361) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))) is different from false [2022-01-31 11:48:15,782 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_735 Int)) (or (forall ((v_ArrVal_2362 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_734 Int)) (or (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_735)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4) (<= 3 c_main_~i~0) (forall ((v_main_~i~0_736 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_736)) (forall ((v_ArrVal_2362 Int) (v_ArrVal_2361 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_735 Int) (v_main_~i~0_734 Int)) (or (not (<= (+ v_main_~i~0_736 1) v_main_~i~0_735)) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)) (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_736)) v_ArrVal_2361) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))) is different from false [2022-01-31 11:48:17,832 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_735 Int)) (or (forall ((v_ArrVal_2362 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_734 Int)) (or (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_735)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 4 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4) (forall ((v_main_~i~0_734 Int)) (or (forall ((v_ArrVal_2364 Int) (v_ArrVal_2367 (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_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_734)))) (forall ((v_main_~i~0_736 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_736)) (forall ((v_ArrVal_2362 Int) (v_ArrVal_2361 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_735 Int) (v_main_~i~0_734 Int)) (or (not (<= (+ v_main_~i~0_736 1) v_main_~i~0_735)) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)) (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_736)) v_ArrVal_2361) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))) is different from false [2022-01-31 11:48:19,910 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2367 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (forall ((v_main_~i~0_735 Int)) (or (forall ((v_ArrVal_2362 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_734 Int)) (or (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_735)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 4 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4) (forall ((v_main_~i~0_734 Int)) (or (forall ((v_ArrVal_2364 Int) (v_ArrVal_2367 (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_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 4)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_734)))) (forall ((v_main_~i~0_736 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_736)) (forall ((v_ArrVal_2362 Int) (v_ArrVal_2361 Int) (v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_main_~i~0_735 Int) (v_main_~i~0_734 Int)) (or (not (<= (+ v_main_~i~0_736 1) v_main_~i~0_735)) (not (<= (+ v_main_~i~0_735 1) v_main_~i~0_734)) (= 4 (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_736)) v_ArrVal_2361) (+ c_main_~a~0.offset (* 4 v_main_~i~0_735)) v_ArrVal_2362) (+ c_main_~a~0.offset (* 4 v_main_~i~0_734)) v_ArrVal_2364)) |c_main_~#sum~0.base| v_ArrVal_2367) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))) is different from false [2022-01-31 11:48:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:48:20,034 INFO L93 Difference]: Finished difference Result 283 states and 355 transitions. [2022-01-31 11:48:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 11:48:20,034 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2022-01-31 11:48:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:48:20,035 INFO L225 Difference]: With dead ends: 283 [2022-01-31 11:48:20,035 INFO L226 Difference]: Without dead ends: 283 [2022-01-31 11:48:20,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=102, Invalid=357, Unknown=13, NotChecked=650, Total=1122 [2022-01-31 11:48:20,036 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:48:20,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 288 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 299 Invalid, 0 Unknown, 361 Unchecked, 0.2s Time] [2022-01-31 11:48:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-01-31 11:48:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-01-31 11:48:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 276 states have (on average 1.2644927536231885) internal successors, (349), 276 states have internal predecessors, (349), 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 11:48:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 355 transitions. [2022-01-31 11:48:20,039 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 355 transitions. Word has length 71 [2022-01-31 11:48:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:48:20,039 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 355 transitions. [2022-01-31 11:48:20,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 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 11:48:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 355 transitions. [2022-01-31 11:48:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:48:20,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:48:20,040 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:48:20,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-01-31 11:48:20,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-01-31 11:48:20,247 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:48:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:48:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1794549275, now seen corresponding path program 10 times [2022-01-31 11:48:20,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:48:20,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907347129] [2022-01-31 11:48:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:48:20,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:48:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:48:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:21,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:48:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:48:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-31 11:48:21,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:48:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907347129] [2022-01-31 11:48:21,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907347129] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:48:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956597306] [2022-01-31 11:48:21,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:48:21,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:48:21,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:48:21,360 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:48:21,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-01-31 11:48:21,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:48:21,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:48:21,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-31 11:48:21,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:48:21,527 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 11:48:21,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:21,607 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 11:48:21,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:21,704 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 11:48:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:21,777 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 11:48:21,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:21,863 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 11:48:21,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:21,958 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 11:48:22,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,052 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 11:48:22,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,320 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 11:48:22,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,355 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 11:48:22,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,384 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 11:48:22,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,418 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 11:48:22,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,450 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 11:48:22,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,484 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 11:48:22,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,631 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 11:48:22,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:22,852 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:48:22,852 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 11:48:23,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:23,139 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:48:23,139 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 11:48:23,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:23,458 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:48:23,458 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 11:48:23,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:23,742 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:48:23,742 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 11:48:24,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:24,101 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:48:24,101 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 11:48:24,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:48:24,331 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:48:24,332 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 11:48:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-31 11:48:24,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:02,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_762 Int) (v_main_~i~0_760 Int) (main_~i~0 Int) (v_ArrVal_2467 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_758 Int) (v_main_~i~0_766 Int) (v_main_~i~0_764 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2467))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse8 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_2467 (+ main_~a~0.offset (* main_~i~0 4))))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse6 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_766))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse6 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_764) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse6 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_762))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse0 .cse6 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_760))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse5 .cse2 .cse0 .cse3 .cse6 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_758))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse5 4)) (= (+ .cse1 .cse5 .cse2 .cse0 .cse3 .cse6 .cse4) (* c_~N~0 4)))))))))))) is different from false [2022-01-31 11:52:51,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_762 Int) (v_main_~i~0_760 Int) (v_ArrVal_2467 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_758 Int) (v_main_~i~0_766 Int) (v_main_~i~0_764 Int) (v_main_~i~0_776 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2467))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_2467 (+ main_~a~0.offset (* 4 v_main_~i~0_776)))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_766))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_764) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_762))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_760))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_758))))) (or (not (= .cse0 4)) (= (* ~N~0 4) (+ .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6)) (not (= .cse2 4)) (not (= .cse3 4)) (not (= .cse1 4)) (not (= .cse4 4)) (not (= .cse5 4)))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:53:01,232 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_762 Int) (v_main_~i~0_760 Int) (v_ArrVal_2467 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_758 Int) (v_main_~i~0_766 Int) (v_main_~i~0_764 Int) (v_main_~i~0_776 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2467))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_2467 (+ main_~a~0.offset (* 4 v_main_~i~0_776)))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_766))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_764) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_762))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_760))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_758))))) (or (not (= .cse0 4)) (= (* ~N~0 4) (+ .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6)) (not (= .cse2 4)) (not (= .cse3 4)) (not (= .cse1 4)) (not (= .cse4 4)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse5 4)) (< (+ c_main_~i~0 2) ~N~0))))))))))) is different from false [2022-01-31 11:53:23,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_762 Int) (v_main_~i~0_760 Int) (v_ArrVal_2467 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_758 Int) (v_main_~i~0_766 Int) (v_main_~i~0_764 Int) (v_main_~i~0_776 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2467))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_2467 (+ main_~a~0.offset (* 4 v_main_~i~0_776)))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_766))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_764) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_762))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_760))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_758))))) (or (not (= .cse0 4)) (= (* ~N~0 4) (+ .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6)) (< (+ c_main_~i~0 3) ~N~0) (not (= .cse2 4)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse3 4)) (not (= .cse1 4)) (not (= .cse4 4)) (not (= .cse5 4)))))))))))) is different from false [2022-01-31 11:53:51,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_762 Int) (v_main_~i~0_760 Int) (v_ArrVal_2467 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_758 Int) (v_main_~i~0_766 Int) (v_main_~i~0_764 Int) (v_main_~i~0_776 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2467))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_2467 (+ main_~a~0.offset (* 4 v_main_~i~0_776)))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_766))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_764) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_762))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_760))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_758))))) (or (not (= .cse0 4)) (< (+ c_main_~i~0 4) ~N~0) (= (* ~N~0 4) (+ .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6)) (not (= .cse2 4)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= .cse3 4)) (not (= .cse1 4)) (not (= .cse4 4)) (not (= .cse5 4)))))))))))) is different from false [2022-01-31 11:54:20,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_762 Int) (v_main_~i~0_760 Int) (v_ArrVal_2467 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_758 Int) (v_main_~i~0_766 Int) (v_main_~i~0_764 Int) (v_main_~i~0_776 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2467))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_2467 (+ main_~a~0.offset (* 4 v_main_~i~0_776)))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_766))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_764) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_762))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_760))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_758))))) (or (not (= .cse0 4)) (= (* ~N~0 4) (+ .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6)) (< (+ c_main_~i~0 5) ~N~0) (not (= .cse2 4)) (not (= .cse3 4)) (not (= .cse1 4)) (not (= .cse4 4)) (not (< (+ c_main_~i~0 4) ~N~0)) (not (= .cse5 4)))))))))))) is different from false [2022-01-31 11:54:53,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_762 Int) (v_main_~i~0_760 Int) (v_ArrVal_2467 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_758 Int) (v_main_~i~0_766 Int) (v_main_~i~0_764 Int) (v_main_~i~0_776 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2467))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_2467 (+ main_~a~0.offset (* 4 v_main_~i~0_776)))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_766))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_764) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_762))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_760))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_758))))) (or (not (= .cse0 4)) (= (* ~N~0 4) (+ .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6)) (< (+ c_main_~i~0 6) ~N~0) (not (= .cse2 4)) (not (= .cse3 4)) (not (= .cse1 4)) (not (= .cse4 4)) (not (< (+ c_main_~i~0 5) ~N~0)) (not (= .cse5 4)))))))))))) is different from false [2022-01-31 11:55:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 47 not checked. [2022-01-31 11:55:09,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956597306] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:55:09,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:55:09,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 26, 27] total 78 [2022-01-31 11:55:09,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657184731] [2022-01-31 11:55:09,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:55:09,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-01-31 11:55:09,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:55:09,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-01-31 11:55:09,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4705, Unknown=38, NotChecked=1008, Total=6006 [2022-01-31 11:55:09,758 INFO L87 Difference]: Start difference. First operand 283 states and 355 transitions. Second operand has 78 states, 76 states have (on average 1.736842105263158) internal successors, (132), 75 states have internal predecessors, (132), 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 11:55:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:55:40,889 INFO L93 Difference]: Finished difference Result 352 states and 436 transitions. [2022-01-31 11:55:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-31 11:55:40,890 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 76 states have (on average 1.736842105263158) internal successors, (132), 75 states have internal predecessors, (132), 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 71 [2022-01-31 11:55:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:55:40,891 INFO L225 Difference]: With dead ends: 352 [2022-01-31 11:55:40,891 INFO L226 Difference]: Without dead ends: 348 [2022-01-31 11:55:40,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 111 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 98.4s TimeCoverageRelationStatistics Valid=412, Invalid=6549, Unknown=39, NotChecked=1190, Total=8190 [2022-01-31 11:55:40,892 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1751 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 11:55:40,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 444 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 967 Invalid, 0 Unknown, 1751 Unchecked, 0.9s Time] [2022-01-31 11:55:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-01-31 11:55:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2022-01-31 11:55:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 337 states have (on average 1.2492581602373887) internal successors, (421), 337 states have internal predecessors, (421), 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 11:55:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 427 transitions. [2022-01-31 11:55:40,896 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 427 transitions. Word has length 71 [2022-01-31 11:55:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:55:40,897 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 427 transitions. [2022-01-31 11:55:40,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 76 states have (on average 1.736842105263158) internal successors, (132), 75 states have internal predecessors, (132), 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 11:55:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 427 transitions. [2022-01-31 11:55:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:55:40,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:55:40,897 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:55:40,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-01-31 11:55:41,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-01-31 11:55:41,098 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:55:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:55:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash -642626519, now seen corresponding path program 7 times [2022-01-31 11:55:41,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:55:41,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676739841] [2022-01-31 11:55:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:55:41,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:55:41,109 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:55:41,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366270984] [2022-01-31 11:55:41,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:55:41,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:55:41,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:55:41,110 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:55:41,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-01-31 11:55:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:55:41,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 11:55:41,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:55:41,351 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 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 11:55:41,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:41,392 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 25 treesize of output 24 [2022-01-31 11:55:41,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:41,424 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 25 treesize of output 24 [2022-01-31 11:55:41,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:41,457 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 25 treesize of output 24 [2022-01-31 11:55:41,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:41,494 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 25 treesize of output 24 [2022-01-31 11:55:41,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:55:41,528 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 25 treesize of output 24 [2022-01-31 11:55:41,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-31 11:55:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 37 proven. 25 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-01-31 11:55:41,587 INFO L328 TraceCheckSpWp]: Computing backward predicates...