/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/s12if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:35:49,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:35:49,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:35:49,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:35:49,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:35:49,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:35:49,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:35:49,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:35:49,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:35:49,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:35:49,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:35:49,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:35:49,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:35:49,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:35:49,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:35:49,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:35:49,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:35:49,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:35:49,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:35:49,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:35:49,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:35:49,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:35:49,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:35:49,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:35:49,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:35:49,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:35:49,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:35:49,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:35:49,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:35:49,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:35:49,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:35:49,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:35:49,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:35:49,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:35:49,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:35:49,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:35:49,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:35:49,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:35:49,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:35:49,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:35:49,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:35:49,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:35:49,446 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:35:49,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:35:49,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:35:49,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:35:49,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:35:49,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:35:49,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:35:49,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:35:49,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:35:49,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:35:49,448 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:35:49,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:35:49,448 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:35:49,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:35:49,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:35:49,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:35:49,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:35:49,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:35:49,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:35:49,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:35:49,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:35:49,449 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:35:49,449 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:35:49,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:35:49,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:35:49,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:35:49,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:35:49,652 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:35:49,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s12if.c [2022-01-31 11:35:49,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adde37cd7/df633f67ab494e0e9feaf378e10fdb81/FLAG08447504a [2022-01-31 11:35:50,053 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:35:50,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s12if.c [2022-01-31 11:35:50,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adde37cd7/df633f67ab494e0e9feaf378e10fdb81/FLAG08447504a [2022-01-31 11:35:50,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adde37cd7/df633f67ab494e0e9feaf378e10fdb81 [2022-01-31 11:35:50,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:35:50,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:35:50,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:35:50,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:35:50,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:35:50,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7346114a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50, skipping insertion in model container [2022-01-31 11:35:50,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:35:50,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:35:50,197 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/s12if.c[588,601] [2022-01-31 11:35:50,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:35:50,215 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:35:50,222 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/s12if.c[588,601] [2022-01-31 11:35:50,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:35:50,237 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:35:50,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50 WrapperNode [2022-01-31 11:35:50,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:35:50,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:35:50,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:35:50,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:35:50,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:35:50,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:35:50,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:35:50,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:35:50,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:35:50,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:50,323 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:35:50,345 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:35:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:35:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:35:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:35:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:35:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:35:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:35:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:35:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:35:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:35:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:35:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:35:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:35:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:35:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:35:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:35:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:35:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:35:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:35:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:35:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:35:50,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:35:50,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:35:50,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:35:50,413 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:35:50,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:35:50,539 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:35:50,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:35:50,543 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 11:35:50,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:35:50 BoogieIcfgContainer [2022-01-31 11:35:50,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:35:50,545 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:35:50,545 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:35:50,546 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:35:50,548 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:35:50" (1/1) ... [2022-01-31 11:35:50,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:35:50 BasicIcfg [2022-01-31 11:35:50,559 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:35:50,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:35:50,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:35:50,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:35:50,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:35:50" (1/4) ... [2022-01-31 11:35:50,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723d5b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:35:50, skipping insertion in model container [2022-01-31 11:35:50,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:35:50" (2/4) ... [2022-01-31 11:35:50,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723d5b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:35:50, skipping insertion in model container [2022-01-31 11:35:50,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:35:50" (3/4) ... [2022-01-31 11:35:50,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723d5b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:35:50, skipping insertion in model container [2022-01-31 11:35:50,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:35:50" (4/4) ... [2022-01-31 11:35:50,564 INFO L111 eAbstractionObserver]: Analyzing ICFG s12if.cJordan [2022-01-31 11:35:50,567 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:35:50,567 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:35:50,596 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:35:50,601 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:35:50,601 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:35:50,609 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:35:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:35:50,614 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:50,614 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:35:50,614 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:50,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash 891722992, now seen corresponding path program 1 times [2022-01-31 11:35:50,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:50,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642444296] [2022-01-31 11:35:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:50,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:50,772 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:35:50,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:50,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642444296] [2022-01-31 11:35:50,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642444296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:35:50,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:35:50,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:35:50,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315989420] [2022-01-31 11:35:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:35:50,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:35:50,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:50,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:35:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:35:50,796 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:35:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:50,840 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-01-31 11:35:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:35:50,842 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:35:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:50,851 INFO L225 Difference]: With dead ends: 36 [2022-01-31 11:35:50,851 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 11:35:50,852 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:35:50,862 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:35:50,863 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:35:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 11:35:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 11:35:50,884 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:35:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-31 11:35:50,885 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2022-01-31 11:35:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:50,886 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-31 11:35:50,886 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:35:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-31 11:35:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 11:35:50,886 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:50,887 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:35:50,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:35:50,887 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:50,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:50,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1828318323, now seen corresponding path program 1 times [2022-01-31 11:35:50,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:50,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474269998] [2022-01-31 11:35:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:50,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:50,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:51,000 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:35:51,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:51,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474269998] [2022-01-31 11:35:51,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474269998] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:35:51,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:35:51,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:35:51,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644257850] [2022-01-31 11:35:51,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:35:51,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:35:51,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:51,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:35:51,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:35:51,003 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:35:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:51,107 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-01-31 11:35:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:35:51,108 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:35:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:51,110 INFO L225 Difference]: With dead ends: 37 [2022-01-31 11:35:51,110 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 11:35:51,114 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:35:51,115 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:35:51,115 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:35:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 11:35:51,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-01-31 11:35:51,123 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:35:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 11:35:51,124 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-01-31 11:35:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:51,125 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 11:35:51,125 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:35:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 11:35:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:35:51,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:51,125 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:35:51,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:35:51,126 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:51,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash -343654416, now seen corresponding path program 1 times [2022-01-31 11:35:51,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:51,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006421000] [2022-01-31 11:35:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:51,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:51,160 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:35:51,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143679937] [2022-01-31 11:35:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:51,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:51,165 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:35:51,166 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:35:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:51,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:35:51,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:51,373 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:35:51,424 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:35:51,437 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:35:51,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:35:51,502 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:35:51,508 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:35:51,509 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:35:51,554 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:35:51,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:51,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006421000] [2022-01-31 11:35:51,555 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:35:51,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143679937] [2022-01-31 11:35:51,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143679937] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:35:51,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:35:51,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-01-31 11:35:51,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353095134] [2022-01-31 11:35:51,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:35:51,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:35:51,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:51,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:35:51,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:35:51,557 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:35:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:51,700 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-01-31 11:35:51,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:35:51,701 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:35:51,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:51,702 INFO L225 Difference]: With dead ends: 47 [2022-01-31 11:35:51,702 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 11:35:51,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-01-31 11:35:51,703 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:51,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:35:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 11:35:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-01-31 11:35:51,706 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:35:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-01-31 11:35:51,707 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 31 [2022-01-31 11:35:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:51,707 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-01-31 11:35:51,707 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:35:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-01-31 11:35:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:35:51,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:51,708 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:35:51,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 11:35:51,908 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:35:51,909 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:51,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2086464751, now seen corresponding path program 1 times [2022-01-31 11:35:51,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:51,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679559557] [2022-01-31 11:35:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:51,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:52,250 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:35:52,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:52,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679559557] [2022-01-31 11:35:52,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679559557] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:35:52,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023158881] [2022-01-31 11:35:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:52,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:52,252 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:35:52,253 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:35:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:52,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:35:52,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:52,369 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:35:52,375 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:35:52,411 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:35:52,478 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:35:52,550 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:35:52,634 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 28 treesize of output 12 [2022-01-31 11:35:52,666 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:35:52,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:35:52,777 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 (= (* c_~N~0 2) (+ .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|))) (not (= .cse0 2))))) is different from false [2022-01-31 11:35:52,914 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:35:52,915 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:35:52,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:35:52,919 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:35:52,922 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:35:52,946 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:35:52,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023158881] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:35:52,947 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:35:52,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 26 [2022-01-31 11:35:52,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76584437] [2022-01-31 11:35:52,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:35:52,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 11:35:52,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:52,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 11:35:52,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=511, Unknown=1, NotChecked=46, Total=650 [2022-01-31 11:35:52,948 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 26 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 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:35:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:53,187 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-01-31 11:35:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:35:53,188 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 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:35:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:53,189 INFO L225 Difference]: With dead ends: 54 [2022-01-31 11:35:53,190 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 11:35:53,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=834, Unknown=1, NotChecked=60, Total=1056 [2022-01-31 11:35:53,191 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:53,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 111 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 186 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-01-31 11:35:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 11:35:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-01-31 11:35:53,194 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:35:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-01-31 11:35:53,195 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 31 [2022-01-31 11:35:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:53,195 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-01-31 11:35:53,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 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:35:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-01-31 11:35:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 11:35:53,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:53,196 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:35:53,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 11:35:53,411 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:35:53,412 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash -637057423, now seen corresponding path program 1 times [2022-01-31 11:35:53,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:53,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034181604] [2022-01-31 11:35:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:53,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:53,435 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:35:53,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620958257] [2022-01-31 11:35:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:53,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:53,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:53,438 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:35:53,440 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:35:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:53,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 11:35:53,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:53,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 11:35:53,542 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:35:53,558 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:35:53,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:35:53,594 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:35:53,597 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:35:53,618 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:35:53,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034181604] [2022-01-31 11:35:53,619 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:35:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620958257] [2022-01-31 11:35:53,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620958257] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:35:53,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:35:53,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 11:35:53,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775305407] [2022-01-31 11:35:53,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:35:53,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:35:53,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:35:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:35:53,621 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:35:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:53,678 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-01-31 11:35:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 11:35:53,678 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:35:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:53,689 INFO L225 Difference]: With dead ends: 56 [2022-01-31 11:35:53,690 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 11:35:53,690 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:35:53,692 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:53,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 132 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:35:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 11:35:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-01-31 11:35:53,701 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:35:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-01-31 11:35:53,706 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 31 [2022-01-31 11:35:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:53,706 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-01-31 11:35:53,706 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:35:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-01-31 11:35:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 11:35:53,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:53,708 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:35:53,726 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:35:53,911 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:35:53,912 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:53,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash -531940331, now seen corresponding path program 2 times [2022-01-31 11:35:53,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:53,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096072630] [2022-01-31 11:35:53,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:53,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:53,967 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:35:53,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096072630] [2022-01-31 11:35:53,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096072630] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:35:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550327168] [2022-01-31 11:35:53,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:35:53,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:53,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:53,968 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:35:53,969 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:35:54,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:35:54,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:35:54,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:35:54,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:54,111 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:35:54,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:35:54,161 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:35:54,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550327168] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:35:54,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:35:54,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 11:35:54,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757857836] [2022-01-31 11:35:54,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:35:54,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:35:54,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:54,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:35:54,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:35:54,162 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:35:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:54,316 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-01-31 11:35:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:35:54,316 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:35:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:54,316 INFO L225 Difference]: With dead ends: 69 [2022-01-31 11:35:54,317 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 11:35:54,317 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:35:54,317 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:54,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 62 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:35:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 11:35:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2022-01-31 11:35:54,320 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:35:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-01-31 11:35:54,320 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 33 [2022-01-31 11:35:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:54,320 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-01-31 11:35:54,321 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:35:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-01-31 11:35:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 11:35:54,321 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:54,321 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:35:54,339 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:35:54,522 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:35:54,522 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1196805917, now seen corresponding path program 1 times [2022-01-31 11:35:54,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:54,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642759691] [2022-01-31 11:35:54,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:54,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:54,532 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:35:54,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012219345] [2022-01-31 11:35:54,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:54,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:54,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:54,533 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:35:54,534 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:35:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:54,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:35:54,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:54,645 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:35:54,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:35:54,703 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:35:54,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:54,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642759691] [2022-01-31 11:35:54,703 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:35:54,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012219345] [2022-01-31 11:35:54,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012219345] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:35:54,704 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:35:54,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 11:35:54,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197599358] [2022-01-31 11:35:54,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:35:54,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 11:35:54,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:54,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 11:35:54,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 11:35:54,705 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:35:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:54,783 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-01-31 11:35:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 11:35:54,783 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:35:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:54,784 INFO L225 Difference]: With dead ends: 62 [2022-01-31 11:35:54,784 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:35:54,784 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:35:54,785 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:54,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:35:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:35:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-01-31 11:35:54,787 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:35:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-01-31 11:35:54,788 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2022-01-31 11:35:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:54,788 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-01-31 11:35:54,788 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:35:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-01-31 11:35:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:35:54,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:54,788 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:35:54,807 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:35:54,989 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:35:54,989 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1165711052, now seen corresponding path program 2 times [2022-01-31 11:35:54,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:54,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067767308] [2022-01-31 11:35:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:54,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:54,999 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:35:54,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530218499] [2022-01-31 11:35:54,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:35:54,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:55,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:55,000 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:35:55,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 11:35:55,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:35:55,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:35:55,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 11:35:55,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:55,145 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:35:55,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:55,206 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:35:55,234 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:35:55,234 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 21 treesize of output 21 [2022-01-31 11:35:55,289 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:35:55,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:35:55,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_205 (Array Int Int)) (v_main_~i~0_63 Int)) (or (< (+ v_main_~i~0_63 1) c_~N~0) (= 2 (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)))) (not (<= v_main_~i~0_63 (+ c_main_~i~0 1))))) is different from false [2022-01-31 11:35:55,512 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:35:55,512 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:35:55,518 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:35:55,518 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:35:55,521 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:35:55,739 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:35:55,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:55,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067767308] [2022-01-31 11:35:55,739 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:35:55,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530218499] [2022-01-31 11:35:55,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530218499] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:35:55,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:35:55,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-01-31 11:35:55,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331400058] [2022-01-31 11:35:55,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:35:55,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 11:35:55,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:35:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 11:35:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=562, Unknown=7, NotChecked=50, Total=756 [2022-01-31 11:35:55,741 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:35:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:35:55,970 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-01-31 11:35:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:35:55,970 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:35:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:35:55,971 INFO L225 Difference]: With dead ends: 71 [2022-01-31 11:35:55,971 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 11:35:55,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=883, Unknown=7, NotChecked=64, Total=1190 [2022-01-31 11:35:55,972 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:35:55,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 168 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 123 Invalid, 0 Unknown, 123 Unchecked, 0.1s Time] [2022-01-31 11:35:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 11:35:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2022-01-31 11:35:55,975 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:35:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-01-31 11:35:55,975 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2022-01-31 11:35:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:35:55,975 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-01-31 11:35:55,976 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:35:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-01-31 11:35:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:35:55,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:35:55,976 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:35:56,005 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:35:56,177 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:35:56,177 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:35:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:35:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1386445909, now seen corresponding path program 3 times [2022-01-31 11:35:56,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:35:56,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280064504] [2022-01-31 11:35:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:35:56,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:35:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:35:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:56,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:35:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:35:56,501 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:35:56,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:35:56,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280064504] [2022-01-31 11:35:56,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280064504] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:35:56,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032602179] [2022-01-31 11:35:56,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:35:56,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:35:56,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:35:56,502 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:35:56,503 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:35:56,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:35:56,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:35:56,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:35:56,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:35:56,578 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:35:56,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:56,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:35:56,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:56,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:35:56,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:56,642 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:35:56,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:56,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:35:56,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:56,836 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:35:56,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:56,934 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:35:56,934 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:35:57,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:35:57,072 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:35:57,072 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:35:57,142 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:35:57,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:01,686 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|)) (.cse1 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (not (= 2 .cse0)) (not (= .cse1 2)) (and (<= (div (+ (- 1) .cse2 .cse1 .cse0) 2) c_main_~i~0) (<= (+ c_main_~i~0 1) (div (+ .cse2 .cse1 .cse0) 2))))))))) is different from false [2022-01-31 11:36:01,756 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 (<= (+ c_main_~i~0 2) (div (+ .cse0 .cse1 .cse2) 2)) (<= (div (+ (- 1) .cse0 .cse1 .cse2) 2) (+ c_main_~i~0 1))) (not (= 2 .cse2)) (not (= .cse1 2)))))))) is different from false [2022-01-31 11:36:01,976 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|)) (.cse1 (select v_ArrVal_249 (+ main_~a~0.offset (* v_main_~i~0_79 4))))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_76 4))))) (or (not (= 2 .cse0)) (not (= .cse1 2)) (and (<= 2 (div (+ .cse2 .cse1 .cse0) 2)) (<= (div (+ (- 1) .cse2 .cse1 .cse0) 2) 1)))))))) is different from false [2022-01-31 11:36:02,341 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:36:02,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032602179] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:02,341 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:02,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 41 [2022-01-31 11:36:02,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886875578] [2022-01-31 11:36:02,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:02,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 11:36:02,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:02,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 11:36:02,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1278, Unknown=7, NotChecked=222, Total=1640 [2022-01-31 11:36:02,343 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 41 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 38 states have internal predecessors, (74), 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:36:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:03,962 INFO L93 Difference]: Finished difference Result 148 states and 187 transitions. [2022-01-31 11:36:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 11:36:03,962 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 38 states have internal predecessors, (74), 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:36:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:03,963 INFO L225 Difference]: With dead ends: 148 [2022-01-31 11:36:03,963 INFO L226 Difference]: Without dead ends: 144 [2022-01-31 11:36:03,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=526, Invalid=3769, Unknown=7, NotChecked=390, Total=4692 [2022-01-31 11:36:03,965 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 146 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:03,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 182 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 663 Invalid, 0 Unknown, 558 Unchecked, 0.4s Time] [2022-01-31 11:36:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-01-31 11:36:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2022-01-31 11:36:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 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:36:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2022-01-31 11:36:03,970 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 39 [2022-01-31 11:36:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:03,970 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2022-01-31 11:36:03,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 38 states have internal predecessors, (74), 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:36:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2022-01-31 11:36:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:36:03,971 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:03,971 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:36:03,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 11:36:04,191 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:36:04,191 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 821770708, now seen corresponding path program 1 times [2022-01-31 11:36:04,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228114751] [2022-01-31 11:36:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:04,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:04,200 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:04,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775977621] [2022-01-31 11:36:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:04,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:04,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:04,201 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:36:04,202 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:36:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:04,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 11:36:04,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:04,293 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:36:04,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:04,330 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:36:04,357 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:36:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 11:36:04,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:06,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_90 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)) (forall ((v_ArrVal_294 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_90 4)) v_ArrVal_294) c_main_~a~0.offset) 2)))) is different from false [2022-01-31 11:36:06,465 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 44 treesize of output 38 [2022-01-31 11:36:06,469 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:36:06,470 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 86 treesize of output 72 [2022-01-31 11:36:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-01-31 11:36:06,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:06,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228114751] [2022-01-31 11:36:06,513 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:06,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775977621] [2022-01-31 11:36:06,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775977621] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:06,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:06,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-31 11:36:06,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405468760] [2022-01-31 11:36:06,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:06,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:36:06,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:36:06,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2022-01-31 11:36:06,515 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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:36:08,536 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_90 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)) (forall ((v_ArrVal_294 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_90 4)) v_ArrVal_294) c_main_~a~0.offset) 2)))) (= (+ (- 1) (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:36:10,545 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_90 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_90)) (forall ((v_ArrVal_294 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_90 4)) v_ArrVal_294) c_main_~a~0.offset) 2)))) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 1)) 1)) is different from false [2022-01-31 11:36:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:10,632 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2022-01-31 11:36:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:36:10,632 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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:36:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:10,633 INFO L225 Difference]: With dead ends: 133 [2022-01-31 11:36:10,633 INFO L226 Difference]: Without dead ends: 133 [2022-01-31 11:36:10,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=83, Invalid=232, Unknown=3, NotChecked=102, Total=420 [2022-01-31 11:36:10,634 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:10,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 197 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 145 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2022-01-31 11:36:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-31 11:36:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2022-01-31 11:36:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 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:36:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2022-01-31 11:36:10,638 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 39 [2022-01-31 11:36:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:10,638 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2022-01-31 11:36:10,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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:36:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-01-31 11:36:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 11:36:10,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:10,640 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:36:10,659 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:36:10,859 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:36:10,859 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1676245229, now seen corresponding path program 1 times [2022-01-31 11:36:10,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:10,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374809798] [2022-01-31 11:36:10,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:10,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:10,868 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:10,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448219124] [2022-01-31 11:36:10,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:10,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:10,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:10,872 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:36:10,873 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:36:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:10,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 11:36:10,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:10,973 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:36:11,007 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:36:11,008 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:36: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:36:11,052 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:36:11,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:11,120 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:36:11,122 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:36:11,145 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:36:11,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:11,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374809798] [2022-01-31 11:36:11,145 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:11,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448219124] [2022-01-31 11:36:11,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448219124] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:11,146 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:11,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-01-31 11:36:11,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651899476] [2022-01-31 11:36:11,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:11,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 11:36:11,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:11,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 11:36:11,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 11:36:11,147 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:36:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:11,260 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-01-31 11:36:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 11:36:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 39 [2022-01-31 11:36:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:11,261 INFO L225 Difference]: With dead ends: 102 [2022-01-31 11:36:11,261 INFO L226 Difference]: Without dead ends: 102 [2022-01-31 11:36:11,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-31 11:36:11,261 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:11,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 146 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-31 11:36:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2022-01-31 11:36:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 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:36:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2022-01-31 11:36:11,265 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 39 [2022-01-31 11:36:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:11,265 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2022-01-31 11:36:11,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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:36:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2022-01-31 11:36:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 11:36:11,266 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:11,266 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:36:11,283 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:36:11,482 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:36:11,483 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1211084633, now seen corresponding path program 3 times [2022-01-31 11:36:11,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:11,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448249350] [2022-01-31 11:36:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:11,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:11,502 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:11,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920948522] [2022-01-31 11:36:11,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:36:11,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:11,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:11,504 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:36:11,507 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:36:11,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 11:36:11,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:11,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:36:11,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:11,676 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:36:11,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:11,754 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:36:11,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:11,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448249350] [2022-01-31 11:36:11,755 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:11,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920948522] [2022-01-31 11:36:11,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920948522] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:11,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:11,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:36:11,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339737907] [2022-01-31 11:36:11,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:11,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:36:11,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:36:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:36:11,756 INFO L87 Difference]: Start difference. First operand 91 states and 114 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:36:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:11,864 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2022-01-31 11:36:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 11:36:11,864 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:36:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:11,865 INFO L225 Difference]: With dead ends: 84 [2022-01-31 11:36:11,865 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 11:36:11,865 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:36:11,866 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 76 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:11,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 78 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 11:36:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-01-31 11:36:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 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:36:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-01-31 11:36:11,869 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 42 [2022-01-31 11:36:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:11,869 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-01-31 11:36:11,869 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:36:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-01-31 11:36:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 11:36:11,870 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:11,870 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:36:11,890 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:36:12,083 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:36:12,083 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:12,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:12,084 INFO L85 PathProgramCache]: Analyzing trace with hash -23692747, now seen corresponding path program 4 times [2022-01-31 11:36:12,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:12,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058228864] [2022-01-31 11:36:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:12,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:12,105 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:12,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878561774] [2022-01-31 11:36:12,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:36:12,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:12,107 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:36:12,108 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:36:12,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:36:12,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:12,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:36:12,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:12,270 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:36:12,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:12,357 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:36:12,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:12,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058228864] [2022-01-31 11:36:12,358 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:12,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878561774] [2022-01-31 11:36:12,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878561774] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:12,358 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:12,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 11:36:12,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339449359] [2022-01-31 11:36:12,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:12,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 11:36:12,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:12,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 11:36:12,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 11:36:12,359 INFO L87 Difference]: Start difference. First operand 54 states and 63 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:36:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:12,498 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-01-31 11:36:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:36:12,498 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:36:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:12,499 INFO L225 Difference]: With dead ends: 60 [2022-01-31 11:36:12,499 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 11:36:12,499 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:36:12,499 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 113 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:12,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 71 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 11:36:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-01-31 11:36:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:36:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-01-31 11:36:12,501 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 44 [2022-01-31 11:36:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:12,502 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-01-31 11:36:12,502 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:36:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-01-31 11:36:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:36:12,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:12,502 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:36:12,518 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:36:12,703 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:36:12,703 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:12,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash 845505913, now seen corresponding path program 5 times [2022-01-31 11:36:12,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:12,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922255778] [2022-01-31 11:36:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:12,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:12,713 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:12,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405293108] [2022-01-31 11:36:12,714 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:36:12,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:12,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:12,715 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:36:12,716 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:36:12,819 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:36:12,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:12,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 11:36:12,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:12,845 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:36:12,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 11:36:12,967 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:36:13,020 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:36:13,048 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:36:13,063 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:36:13,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:13,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_480) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2022-01-31 11:36:13,110 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_480) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:36:13,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_480) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2)) is different from false [2022-01-31 11:36:13,154 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:13,155 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:36:13,160 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:13,161 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:36:13,164 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:36:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2022-01-31 11:36:13,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:13,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922255778] [2022-01-31 11:36:13,234 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:13,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405293108] [2022-01-31 11:36:13,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405293108] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:13,234 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:13,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-01-31 11:36:13,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007514687] [2022-01-31 11:36:13,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:13,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:36:13,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:13,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:36:13,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=195, Unknown=3, NotChecked=90, Total=342 [2022-01-31 11:36:13,235 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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:36:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:13,488 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-01-31 11:36:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:36:13,489 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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 47 [2022-01-31 11:36:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:13,489 INFO L225 Difference]: With dead ends: 97 [2022-01-31 11:36:13,489 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 11:36:13,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=271, Unknown=3, NotChecked=108, Total=462 [2022-01-31 11:36:13,490 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:13,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 212 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 421 Invalid, 0 Unknown, 197 Unchecked, 0.2s Time] [2022-01-31 11:36:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 11:36:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 68. [2022-01-31 11:36:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 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:36:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2022-01-31 11:36:13,492 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 47 [2022-01-31 11:36:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:13,492 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2022-01-31 11:36:13,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 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:36:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-01-31 11:36:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:36:13,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:13,493 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:36:13,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 11:36:13,699 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:36:13,699 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -897304422, now seen corresponding path program 6 times [2022-01-31 11:36:13,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:13,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638999607] [2022-01-31 11:36:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:13,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:13,713 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:13,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1842662665] [2022-01-31 11:36:13,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:36:13,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:13,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:13,719 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:36:13,720 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:36:13,790 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:36:13,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:13,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 11:36:13,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:13,858 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:36:13,885 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:36:13,885 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:36:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:14,019 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 20 treesize of output 22 [2022-01-31 11:36:14,052 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-31 11:36:14,052 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 25 treesize of output 14 [2022-01-31 11:36:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 11:36:14,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:14,189 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~N~0 (+ c_main_~i~0 2)) (forall ((v_ArrVal_535 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2))) is different from false [2022-01-31 11:36:14,204 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~N~0 2) (forall ((v_ArrVal_535 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) is different from false [2022-01-31 11:36:14,211 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_main_~i~0 2) (forall ((v_ArrVal_535 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) is different from false [2022-01-31 11:36:14,217 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_main_~i~0 1) (forall ((v_ArrVal_535 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) is different from false [2022-01-31 11:36:14,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (<= main_~i~0 1) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 2 (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 (* main_~i~0 4)) v_ArrVal_534)) |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))) is different from false [2022-01-31 11:36:14,905 INFO L353 Elim1Store]: treesize reduction 28, result has 56.3 percent of original size [2022-01-31 11:36:14,905 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 52 [2022-01-31 11:36:14,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:14,911 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 47 treesize of output 47 [2022-01-31 11:36:14,914 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:36:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 13 not checked. [2022-01-31 11:36:15,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638999607] [2022-01-31 11:36:15,017 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842662665] [2022-01-31 11:36:15,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842662665] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:15,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:15,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-01-31 11:36:15,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237155398] [2022-01-31 11:36:15,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:15,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-31 11:36:15,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-31 11:36:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=498, Unknown=5, NotChecked=250, Total=870 [2022-01-31 11:36:15,019 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 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:36:17,106 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2))) (and (= 0 (+ (- 1) c_main_~i~0)) .cse0 (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (or (<= c_~N~0 2) .cse0) (forall ((main_~i~0 Int)) (or (<= main_~i~0 1) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 2 (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 (* main_~i~0 4)) v_ArrVal_534)) |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))) (= c_main_~i~0 1))) is different from false [2022-01-31 11:36:19,109 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((main_~i~0 Int)) (or (<= main_~i~0 1) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 Int)) (= 2 (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 (* main_~i~0 4)) v_ArrVal_534)) |c_main_~#sum~0.base| v_ArrVal_535) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))) is different from false [2022-01-31 11:36:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:19,382 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2022-01-31 11:36:19,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 11:36:19,383 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 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:36:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:19,383 INFO L225 Difference]: With dead ends: 100 [2022-01-31 11:36:19,383 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 11:36:19,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=225, Invalid=852, Unknown=7, NotChecked=476, Total=1560 [2022-01-31 11:36:19,384 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:19,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 265 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 396 Invalid, 0 Unknown, 238 Unchecked, 0.2s Time] [2022-01-31 11:36:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 11:36:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2022-01-31 11:36:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 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:36:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-01-31 11:36:19,386 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 47 [2022-01-31 11:36:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:19,386 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-01-31 11:36:19,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 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:36:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-01-31 11:36:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:36:19,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:19,387 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:36:19,404 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:36:19,591 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:36:19,591 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 899646937, now seen corresponding path program 4 times [2022-01-31 11:36:19,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:19,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904211717] [2022-01-31 11:36:19,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:19,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:20,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:20,008 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:36:20,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904211717] [2022-01-31 11:36:20,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904211717] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397443450] [2022-01-31 11:36:20,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:36:20,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:20,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:20,010 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:36:20,011 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:36:20,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:36:20,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:20,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 11:36:20,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:20,087 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:36:20,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,147 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:36:20,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,184 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:36:20,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,222 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:36:20,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,371 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:36:20,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,403 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:36:20,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,437 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:36:20,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,521 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:36:20,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,617 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:36:20,617 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:36:20,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,737 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:36:20,738 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:36:20,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:20,877 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:36:20,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2022-01-31 11:36:20,965 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:36:20,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:24,285 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_169 Int) (main_~i~0 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_171 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_593))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_593 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse3 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_171))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_169))))) (or (not (= 2 .cse0)) (not (= .cse1 2)) (= (+ .cse2 .cse1 .cse0 .cse3) (* c_~N~0 2)) (not (= .cse2 2))))))))) is different from false [2022-01-31 11:36:25,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_169 Int) (v_main_~i~0_178 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_171 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_593))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_593 (+ main_~a~0.offset (* 4 v_main_~i~0_178)))) (.cse2 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_171))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_169))))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (= (* 2 ~N~0) (+ .cse0 .cse1 .cse2 .cse3)) (not (= 2 .cse3))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:36:25,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_169 Int) (v_main_~i~0_178 Int) (~N~0 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_171 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_593))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_593 (+ main_~a~0.offset (* 4 v_main_~i~0_178)))) (.cse2 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_171))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_169))))) (or (not (= 2 .cse0)) (not (= 2 .cse1)) (= (* 2 ~N~0) (+ .cse0 .cse1 .cse2 .cse3)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= 2 .cse3)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 11:36:25,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_169 Int) (v_main_~i~0_178 Int) (~N~0 Int) (v_ArrVal_593 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_171 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_593))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_593 (+ main_~a~0.offset (* 4 v_main_~i~0_178)))) (.cse2 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_171))))) (let ((.cse1 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_169))))) (or (not (= 2 .cse0)) (< (+ c_main_~i~0 3) ~N~0) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 2 .cse1)) (= (* 2 ~N~0) (+ .cse0 .cse1 .cse2 .cse3)) (not (= 2 .cse3))))))))) is different from false [2022-01-31 11:36:25,612 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:36:25,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397443450] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:25,613 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:25,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 18] total 48 [2022-01-31 11:36:25,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618789119] [2022-01-31 11:36:25,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:25,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 11:36:25,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 11:36:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1744, Unknown=6, NotChecked=348, Total=2256 [2022-01-31 11:36:25,614 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 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:36:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:26,585 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-01-31 11:36:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 11:36:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 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:36:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:26,586 INFO L225 Difference]: With dead ends: 110 [2022-01-31 11:36:26,586 INFO L226 Difference]: Without dead ends: 106 [2022-01-31 11:36:26,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 78 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=290, Invalid=2800, Unknown=6, NotChecked=444, Total=3540 [2022-01-31 11:36:26,587 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:26,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 209 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 395 Invalid, 0 Unknown, 447 Unchecked, 0.2s Time] [2022-01-31 11:36:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-31 11:36:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-01-31 11:36:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.2) internal successors, (114), 95 states have internal predecessors, (114), 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:36:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2022-01-31 11:36:26,590 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 47 [2022-01-31 11:36:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:26,590 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2022-01-31 11:36:26,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 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:36:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2022-01-31 11:36:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 11:36:26,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:26,590 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:36:26,607 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:36:26,799 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:36:26,799 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1034042, now seen corresponding path program 2 times [2022-01-31 11:36:26,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:26,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750218553] [2022-01-31 11:36:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:26,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:26,810 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:26,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785277540] [2022-01-31 11:36:26,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:36:26,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:26,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:26,811 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:36:26,812 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:36:26,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:36:26,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:26,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 11:36:26,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:26,937 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:36:26,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:26,974 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:36:27,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:27,002 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:36:27,022 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:36:27,047 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:36:27,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:27,148 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:36:27,149 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:36:27,195 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:36:27,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:27,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750218553] [2022-01-31 11:36:27,196 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:27,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785277540] [2022-01-31 11:36:27,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785277540] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:27,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:27,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-01-31 11:36:27,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092743404] [2022-01-31 11:36:27,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:27,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 11:36:27,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:27,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 11:36:27,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-01-31 11:36:27,197 INFO L87 Difference]: Start difference. First operand 102 states and 120 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:36:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:27,362 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-01-31 11:36:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:36:27,363 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:36:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:27,363 INFO L225 Difference]: With dead ends: 104 [2022-01-31 11:36:27,363 INFO L226 Difference]: Without dead ends: 104 [2022-01-31 11:36:27,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:36:27,364 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:27,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 178 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-01-31 11:36:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-01-31 11:36:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 93 states have internal predecessors, (109), 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:36:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2022-01-31 11:36:27,366 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 47 [2022-01-31 11:36:27,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:27,366 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2022-01-31 11:36:27,366 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:36:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2022-01-31 11:36:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 11:36:27,367 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:27,367 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:36:27,386 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:36:27,583 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:36:27,583 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:27,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:27,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1182980387, now seen corresponding path program 5 times [2022-01-31 11:36:27,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:27,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176774729] [2022-01-31 11:36:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:27,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:27,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:27,708 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:36:27,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:27,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176774729] [2022-01-31 11:36:27,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176774729] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:27,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382611240] [2022-01-31 11:36:27,708 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:36:27,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:27,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:27,709 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:36:27,710 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:36:27,797 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 11:36:27,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:27,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:36:27,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:27,910 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:36:27,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:28,002 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:36:28,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382611240] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:28,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:36:28,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 11:36:28,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25350689] [2022-01-31 11:36:28,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:28,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:36:28,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:28,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:36:28,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:36:28,004 INFO L87 Difference]: Start difference. First operand 100 states and 115 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:36:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:28,294 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2022-01-31 11:36:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:36:28,295 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:36:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:28,295 INFO L225 Difference]: With dead ends: 103 [2022-01-31 11:36:28,295 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 11:36:28,296 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:36:28,296 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 93 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:28,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 85 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:36:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 11:36:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2022-01-31 11:36:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.16) internal successors, (87), 75 states have internal predecessors, (87), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:36:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2022-01-31 11:36:28,298 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 49 [2022-01-31 11:36:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:28,298 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2022-01-31 11:36:28,298 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:36:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-01-31 11:36:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:36:28,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:28,299 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:36:28,316 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:36:28,511 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:36:28,511 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:28,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1207498923, now seen corresponding path program 7 times [2022-01-31 11:36:28,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:28,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472129081] [2022-01-31 11:36:28,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:28,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:28,525 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:28,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051233117] [2022-01-31 11:36:28,526 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:36:28,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:28,527 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:36:28,528 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:36:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:28,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 11:36:28,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:28,707 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:36:28,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:28,805 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:36:28,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:28,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472129081] [2022-01-31 11:36:28,805 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:28,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051233117] [2022-01-31 11:36:28,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051233117] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:28,805 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:28,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 11:36:28,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404546934] [2022-01-31 11:36:28,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:28,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:36:28,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:36:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:36:28,806 INFO L87 Difference]: Start difference. First operand 82 states and 93 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:36:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:28,958 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-01-31 11:36:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:36:28,958 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:36:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:28,959 INFO L225 Difference]: With dead ends: 90 [2022-01-31 11:36:28,959 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 11:36:28,959 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:36:28,960 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 82 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:28,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 109 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:36:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 11:36:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2022-01-31 11:36:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 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:36:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-01-31 11:36:28,961 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 50 [2022-01-31 11:36:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:28,961 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-01-31 11:36:28,961 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:36:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-01-31 11:36:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:36:28,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:28,962 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:36:28,980 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:36:29,175 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:36:29,175 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash -392195492, now seen corresponding path program 8 times [2022-01-31 11:36:29,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:29,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878676395] [2022-01-31 11:36:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:29,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:29,184 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:29,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622589614] [2022-01-31 11:36:29,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:36:29,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:29,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:29,185 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:36:29,186 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:36:29,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:36:29,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:29,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 11:36:29,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:29,374 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:36:29,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:29,422 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:36:29,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:29,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 11:36:29,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:29,487 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:36:29,522 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:36:29,539 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:36:29,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:29,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_830) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:36:29,581 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_830) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:36:29,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_830) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:36:29,597 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_830) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:36:29,632 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:29,632 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:36:29,636 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:29,636 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:36:29,638 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:36:29,783 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:36:29,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:29,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878676395] [2022-01-31 11:36:29,783 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:29,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622589614] [2022-01-31 11:36:29,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622589614] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:29,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:29,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 11:36:29,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845526202] [2022-01-31 11:36:29,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:29,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 11:36:29,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 11:36:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-01-31 11:36:29,785 INFO L87 Difference]: Start difference. First operand 62 states and 71 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:36:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:30,168 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-01-31 11:36:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:36:30,168 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:36:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:30,169 INFO L225 Difference]: With dead ends: 88 [2022-01-31 11:36:30,169 INFO L226 Difference]: Without dead ends: 88 [2022-01-31 11:36:30,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 84 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=495, Unknown=4, NotChecked=196, Total=812 [2022-01-31 11:36:30,169 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 76 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:30,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 317 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 600 Invalid, 0 Unknown, 293 Unchecked, 0.3s Time] [2022-01-31 11:36:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-31 11:36:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2022-01-31 11:36:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 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:36:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2022-01-31 11:36:30,171 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 55 [2022-01-31 11:36:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:30,171 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2022-01-31 11:36:30,172 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:36:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-01-31 11:36:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:36:30,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:30,172 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:36:30,189 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:36:30,375 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:36:30,376 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:30,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:30,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2135005827, now seen corresponding path program 9 times [2022-01-31 11:36:30,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:30,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754151188] [2022-01-31 11:36:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:30,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:30,384 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:30,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316682610] [2022-01-31 11:36:30,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:36:30,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:30,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:30,386 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:36:30,387 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:36:30,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:36:30,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:30,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-31 11:36:30,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:30,624 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:36:30,669 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:36:30,669 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:36:30,744 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:36:30,744 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:36:30,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:30,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 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 11:36:30,855 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:36:30,877 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:36:30,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:30,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_899) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2022-01-31 11:36:30,928 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_899) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:36:31,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 Int) (main_~i~0 Int) (v_ArrVal_899 (Array Int Int)) (v_main_~i~0_270 Int) (v_ArrVal_897 Int)) (or (< (+ v_main_~i~0_270 1) c_~N~0) (not (<= v_main_~i~0_270 (+ main_~i~0 1))) (= (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_895) (+ c_main_~a~0.offset (* 4 v_main_~i~0_270)) v_ArrVal_897)) |c_main_~#sum~0.base| v_ArrVal_899) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2))) is different from false [2022-01-31 11:36:31,224 INFO L353 Elim1Store]: treesize reduction 96, result has 40.4 percent of original size [2022-01-31 11:36:31,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, 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:36:31,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:31,239 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:36:31,244 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:36:31,555 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:36:31,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:31,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754151188] [2022-01-31 11:36:31,556 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:31,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316682610] [2022-01-31 11:36:31,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316682610] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:31,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:31,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2022-01-31 11:36:31,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978453165] [2022-01-31 11:36:31,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:31,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 11:36:31,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:31,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 11:36:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=874, Unknown=7, NotChecked=192, Total=1260 [2022-01-31 11:36:31,557 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 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:36:32,975 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_895 Int) (main_~i~0 Int) (v_ArrVal_899 (Array Int Int)) (v_main_~i~0_270 Int) (v_ArrVal_897 Int)) (or (< (+ v_main_~i~0_270 1) c_~N~0) (not (<= v_main_~i~0_270 (+ main_~i~0 1))) (= (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_895) (+ c_main_~a~0.offset (* 4 v_main_~i~0_270)) v_ArrVal_897)) |c_main_~#sum~0.base| v_ArrVal_899) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2))) (= c_main_~i~0 1) (< 3 c_~N~0)) is different from false [2022-01-31 11:36:34,983 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_895 Int) (main_~i~0 Int) (v_ArrVal_899 (Array Int Int)) (v_main_~i~0_270 Int) (v_ArrVal_897 Int)) (or (< (+ v_main_~i~0_270 1) c_~N~0) (not (<= v_main_~i~0_270 (+ main_~i~0 1))) (= (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_895) (+ c_main_~a~0.offset (* 4 v_main_~i~0_270)) v_ArrVal_897)) |c_main_~#sum~0.base| v_ArrVal_899) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2))) (< 3 c_~N~0)) is different from false [2022-01-31 11:36:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:35,279 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2022-01-31 11:36:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 11:36:35,280 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 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 55 [2022-01-31 11:36:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:35,280 INFO L225 Difference]: With dead ends: 99 [2022-01-31 11:36:35,280 INFO L226 Difference]: Without dead ends: 99 [2022-01-31 11:36:35,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=327, Invalid=1324, Unknown=9, NotChecked=410, Total=2070 [2022-01-31 11:36:35,281 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 79 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:35,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 266 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 350 Invalid, 0 Unknown, 270 Unchecked, 0.2s Time] [2022-01-31 11:36:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-31 11:36:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2022-01-31 11:36:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 78 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:36:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-01-31 11:36:35,286 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 55 [2022-01-31 11:36:35,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:35,286 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-01-31 11:36:35,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 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:36:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-01-31 11:36:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:36:35,295 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:35,295 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:36:35,314 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:36:35,512 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:36:35,512 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1629447202, now seen corresponding path program 10 times [2022-01-31 11:36:35,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:35,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486828127] [2022-01-31 11:36:35,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:35,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:35,521 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:36:35,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814634974] [2022-01-31 11:36:35,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:36:35,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:35,523 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:36:35,530 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:36:35,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:36:35,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:35,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-31 11:36:35,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:35,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, 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:36:35,769 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:36:35,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:36:35,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:35,820 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:36:35,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:35,852 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:36:35,877 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:36:35,896 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:36:35,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:36:35,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_967 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_967) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2022-01-31 11:36:35,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_967 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_967) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:36:35,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_967 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_967) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:36:35,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_967 (Array Int Int)) (v_ArrVal_965 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_965)) |c_main_~#sum~0.base| v_ArrVal_967) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2)) is different from false [2022-01-31 11:36:35,982 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_291 Int)) (or (forall ((v_ArrVal_967 (Array Int Int)) (v_ArrVal_965 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_291)) v_ArrVal_965)) |c_main_~#sum~0.base| v_ArrVal_967) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_291)))) is different from false [2022-01-31 11:36:36,047 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:36:36,047 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:36:36,052 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:36:36,052 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:36:36,054 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:36:36,163 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:36:36,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486828127] [2022-01-31 11:36:36,164 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:36:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814634974] [2022-01-31 11:36:36,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814634974] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:36:36,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:36:36,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 11:36:36,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108447968] [2022-01-31 11:36:36,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:36:36,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 11:36:36,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:36:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 11:36:36,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=381, Unknown=5, NotChecked=220, Total=702 [2022-01-31 11:36:36,165 INFO L87 Difference]: Start difference. First operand 85 states and 99 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:36:38,254 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 2) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_291 Int)) (or (forall ((v_ArrVal_967 (Array Int Int)) (v_ArrVal_965 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_291)) v_ArrVal_965)) |c_main_~#sum~0.base| v_ArrVal_967) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_291)))) (= 2 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)))) is different from false [2022-01-31 11:36:40,277 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_ArrVal_967 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_967) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2) (forall ((v_main_~i~0_291 Int)) (or (forall ((v_ArrVal_967 (Array Int Int)) (v_ArrVal_965 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_291)) v_ArrVal_965)) |c_main_~#sum~0.base| v_ArrVal_967) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_291)))) (<= 3 c_main_~i~0)) is different from false [2022-01-31 11:36:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:36:40,491 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2022-01-31 11:36:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 11:36:40,491 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:36:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:36:40,493 INFO L225 Difference]: With dead ends: 124 [2022-01-31 11:36:40,493 INFO L226 Difference]: Without dead ends: 124 [2022-01-31 11:36:40,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=124, Invalid=497, Unknown=7, NotChecked=364, Total=992 [2022-01-31 11:36:40,494 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:36:40,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 282 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 407 Invalid, 0 Unknown, 323 Unchecked, 0.2s Time] [2022-01-31 11:36:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-31 11:36:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2022-01-31 11:36:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 107 states have (on average 1.233644859813084) internal successors, (132), 107 states have internal predecessors, (132), 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:36:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2022-01-31 11:36:40,496 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 55 [2022-01-31 11:36:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:36:40,496 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2022-01-31 11:36:40,497 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:36:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2022-01-31 11:36:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:36:40,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:36:40,497 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:36:40,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-31 11:36:40,710 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:36:40,710 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:36:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:36:40,710 INFO L85 PathProgramCache]: Analyzing trace with hash 167504157, now seen corresponding path program 6 times [2022-01-31 11:36:40,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:36:40,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811036633] [2022-01-31 11:36:40,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:36:40,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:36:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:36:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:36:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:36:41,433 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:36:41,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:36:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811036633] [2022-01-31 11:36:41,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811036633] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:36:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878974613] [2022-01-31 11:36:41,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:36:41,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:36:41,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:36:41,435 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:36:41,435 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:36:41,535 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 11:36:41,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:36:41,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-31 11:36:41,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:36:41,556 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:36:41,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,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 14 treesize of output 16 [2022-01-31 11:36:41,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,636 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:36:41,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 11:36:41,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,725 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:36:41,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,788 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:36:41,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,810 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:36:41,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,832 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:36:41,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,853 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:36:41,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:41,972 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:36:42,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:42,180 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:36:42,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-01-31 11:36:42,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:42,493 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:36:42,493 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 76 treesize of output 57 [2022-01-31 11:36:42,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:42,894 INFO L353 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-01-31 11:36:42,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 75 [2022-01-31 11:36:47,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:36:47,552 INFO L353 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2022-01-31 11:36:47,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 21 [2022-01-31 11:36:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 11:36:47,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:37:26,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_311 Int) (v_ArrVal_1039 (Array Int Int)) (main_~a~0.offset Int)) (or (not (<= v_main_~i~0_311 0)) (forall ((v_main_~i~0_310 Int) (v_main_~i~0_308 Int) (v_main_~i~0_309 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1039))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse6 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_310))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_308))))) (or (not (<= v_main_~i~0_308 (+ v_main_~i~0_309 1))) (not (= .cse0 2)) (not (<= v_main_~i~0_309 (+ v_main_~i~0_310 1))) (< (+ v_main_~i~0_308 1) c_~N~0) (not (= .cse1 2)) (= (+ .cse1 .cse2 .cse0 .cse3 .cse4) (* c_~N~0 2)) (not (= 2 .cse3)) (not (<= v_main_~i~0_310 (+ v_main_~i~0_311 1))))))))))) (not (= 2 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))))) is different from false [2022-01-31 11:37:27,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1039 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_308 Int) (v_main_~i~0_309 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1039))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse6 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_310))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse0 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_308))))) (or (not (<= v_main_~i~0_311 0)) (not (<= v_main_~i~0_308 (+ v_main_~i~0_309 1))) (not (= .cse0 2)) (not (<= v_main_~i~0_309 (+ v_main_~i~0_310 1))) (< (+ v_main_~i~0_308 1) c_~N~0) (not (= .cse1 2)) (= (+ .cse1 .cse2 .cse0 .cse3 .cse4) (* c_~N~0 2)) (not (= 2 .cse3)) (not (= 2 .cse4)) (not (<= v_main_~i~0_310 (+ v_main_~i~0_311 1))))))))))) is different from false [2022-01-31 11:37:31,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1039 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_308 Int) (v_main_~i~0_309 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1039))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_310))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_308))))) (or (not (<= v_main_~i~0_311 0)) (not (<= v_main_~i~0_308 (+ v_main_~i~0_309 1))) (< (+ v_main_~i~0_308 1) ~N~0) (not (= .cse0 2)) (not (<= v_main_~i~0_309 (+ v_main_~i~0_310 1))) (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (= (* 2 ~N~0) (+ .cse1 .cse4 .cse0 .cse2 .cse3)) (not (<= v_main_~i~0_310 (+ v_main_~i~0_311 1))))))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:37:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 6 times theorem prover too weak. 7 trivial. 25 not checked. [2022-01-31 11:37:35,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878974613] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:37:35,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:37:35,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 69 [2022-01-31 11:37:35,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801712028] [2022-01-31 11:37:35,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:37:35,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-01-31 11:37:35,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:37:35,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-01-31 11:37:35,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=3911, Unknown=81, NotChecked=390, Total=4692 [2022-01-31 11:37:35,582 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 69 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 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:37:36,194 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (<= 3 c_main_~i~0))) (and (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1039 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_308 Int) (v_main_~i~0_309 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1039))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_310))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_308))))) (or (not (<= v_main_~i~0_311 0)) (not (<= v_main_~i~0_308 (+ v_main_~i~0_309 1))) (< (+ v_main_~i~0_308 1) ~N~0) (not (= .cse0 2)) (not (<= v_main_~i~0_309 (+ v_main_~i~0_310 1))) (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (= (* 2 ~N~0) (+ .cse1 .cse4 .cse0 .cse2 .cse3)) (not (<= v_main_~i~0_310 (+ v_main_~i~0_311 1))))))))))) (not (< c_main_~i~0 ~N~0)))) (or (not (<= c_~N~0 3)) .cse7) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (or (<= c_~N~0 4) (<= c_main_~i~0 3)) .cse7)) is different from false [2022-01-31 11:37:36,414 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (< 3 c_~N~0))) (and (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1039 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_308 Int) (v_main_~i~0_309 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1039))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_310))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_308))))) (or (not (<= v_main_~i~0_311 0)) (not (<= v_main_~i~0_308 (+ v_main_~i~0_309 1))) (< (+ v_main_~i~0_308 1) ~N~0) (not (= .cse0 2)) (not (<= v_main_~i~0_309 (+ v_main_~i~0_310 1))) (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (= (* 2 ~N~0) (+ .cse1 .cse4 .cse0 .cse2 .cse3)) (not (<= v_main_~i~0_310 (+ v_main_~i~0_311 1))))))))))) (not (< c_main_~i~0 ~N~0)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (or (and (<= c_main_~i~0 4) .cse7) (= (* c_~N~0 2) 8)) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1039 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_308 Int) (v_main_~i~0_309 Int)) (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1039))) (let ((.cse14 (select .cse13 |c_main_~#sum~0.base|))) (let ((.cse10 (select .cse14 |c_main_~#sum~0.offset|)) (.cse12 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse9 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ .cse10 .cse12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_310))))) (let ((.cse8 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ .cse9 .cse10 .cse12))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (let ((.cse11 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ .cse9 .cse10 .cse8 .cse12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_308))))) (or (not (<= v_main_~i~0_311 0)) (not (<= v_main_~i~0_308 (+ v_main_~i~0_309 1))) (not (= .cse8 2)) (not (<= v_main_~i~0_309 (+ v_main_~i~0_310 1))) (< (+ v_main_~i~0_308 1) c_~N~0) (not (= .cse9 2)) (= (+ .cse9 .cse10 .cse8 .cse11 .cse12) (* c_~N~0 2)) (not (= 2 .cse11)) (not (= 2 .cse12)) (not (<= v_main_~i~0_310 (+ v_main_~i~0_311 1))))))))))) (<= 3 c_main_~i~0) .cse7)) is different from false [2022-01-31 11:37:36,981 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1039 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_308 Int) (v_main_~i~0_309 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1039))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse4 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_310))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse3))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_308))))) (or (not (<= v_main_~i~0_311 0)) (not (<= v_main_~i~0_308 (+ v_main_~i~0_309 1))) (< (+ v_main_~i~0_308 1) ~N~0) (not (= .cse0 2)) (not (<= v_main_~i~0_309 (+ v_main_~i~0_310 1))) (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (= (* 2 ~N~0) (+ .cse1 .cse4 .cse0 .cse2 .cse3)) (not (<= v_main_~i~0_310 (+ v_main_~i~0_311 1))))))))))) (not (< c_main_~i~0 ~N~0)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (forall ((v_main_~i~0_311 Int) (v_main_~i~0_310 Int) (v_ArrVal_1039 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_308 Int) (v_main_~i~0_309 Int)) (let ((.cse12 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1039))) (let ((.cse13 (select .cse12 |c_main_~#sum~0.base|))) (let ((.cse9 (select .cse13 |c_main_~#sum~0.offset|)) (.cse11 (select v_ArrVal_1039 (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse8 (select (select (store .cse12 |c_main_~#sum~0.base| (store .cse13 |c_main_~#sum~0.offset| (+ .cse9 .cse11))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_310))))) (let ((.cse7 (select (select (store .cse12 |c_main_~#sum~0.base| (store .cse13 |c_main_~#sum~0.offset| (+ .cse8 .cse9 .cse11))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (let ((.cse10 (select (select (store .cse12 |c_main_~#sum~0.base| (store .cse13 |c_main_~#sum~0.offset| (+ .cse8 .cse9 .cse7 .cse11))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_308))))) (or (not (<= v_main_~i~0_311 0)) (not (<= v_main_~i~0_308 (+ v_main_~i~0_309 1))) (not (= .cse7 2)) (not (<= v_main_~i~0_309 (+ v_main_~i~0_310 1))) (< (+ v_main_~i~0_308 1) c_~N~0) (not (= .cse8 2)) (= (+ .cse8 .cse9 .cse7 .cse10 .cse11) (* c_~N~0 2)) (not (= 2 .cse10)) (not (= 2 .cse11)) (not (<= v_main_~i~0_310 (+ v_main_~i~0_311 1))))))))))) (<= 3 c_main_~i~0) (< 3 c_~N~0)) is different from false [2022-01-31 11:37:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:37:52,881 INFO L93 Difference]: Finished difference Result 214 states and 259 transitions. [2022-01-31 11:37:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-31 11:37:52,882 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 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:37:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:37:52,883 INFO L225 Difference]: With dead ends: 214 [2022-01-31 11:37:52,883 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 11:37:52,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 101 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=739, Invalid=8497, Unknown=100, NotChecked=1170, Total=10506 [2022-01-31 11:37:52,885 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 82 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 659 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:37:52,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 237 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 550 Invalid, 0 Unknown, 659 Unchecked, 0.3s Time] [2022-01-31 11:37:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 11:37:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 123. [2022-01-31 11:37:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 116 states have (on average 1.25) internal successors, (145), 116 states have internal predecessors, (145), 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:37:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2022-01-31 11:37:52,888 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 55 [2022-01-31 11:37:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:37:52,888 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2022-01-31 11:37:52,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 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:37:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-01-31 11:37:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:37:52,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:37:52,889 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:37:52,908 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:37:53,095 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:37:53,095 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:37:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:37:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1225567900, now seen corresponding path program 3 times [2022-01-31 11:37:53,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:37:53,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821828205] [2022-01-31 11:37:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:37:53,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:37:53,105 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:37:53,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561782071] [2022-01-31 11:37:53,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:37:53,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:37:53,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:37:53,106 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:37:53,107 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:37:53,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 11:37:53,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:37:53,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 11:37:53,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:37:53,417 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:37:53,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:37:53,472 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:37:53,516 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:37:53,517 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:37:53,583 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 11:37:53,583 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 32 [2022-01-31 11:37:53,666 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:37:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:37:53,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:38:36,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_334 Int) (v_ArrVal_1112 Int) (v_ArrVal_1114 Int) (v_ArrVal_1116 Int) (v_main_~i~0_336 Int)) (or (< (+ v_main_~i~0_334 1) c_~N~0) (not (<= v_main_~i~0_334 (+ v_main_~i~0_336 1))) (= 2 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1112) (+ c_main_~a~0.offset (* 4 v_main_~i~0_336)) v_ArrVal_1114) (+ (* 4 v_main_~i~0_334) c_main_~a~0.offset) v_ArrVal_1116) c_main_~a~0.offset)))) is different from false [2022-01-31 11:38:38,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_337 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_337)) (forall ((v_main_~i~0_334 Int) (v_ArrVal_1112 Int) (v_ArrVal_1114 Int) (v_ArrVal_1116 Int) (v_main_~i~0_336 Int)) (or (< (+ v_main_~i~0_334 1) c_~N~0) (not (<= v_main_~i~0_334 (+ v_main_~i~0_336 1))) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) c_main_~a~0.offset) v_ArrVal_1112) (+ c_main_~a~0.offset (* 4 v_main_~i~0_336)) v_ArrVal_1114) (+ (* 4 v_main_~i~0_334) c_main_~a~0.offset) v_ArrVal_1116) c_main_~a~0.offset) 2))))) is different from false [2022-01-31 11:38:40,595 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 58 treesize of output 52 [2022-01-31 11:38:40,604 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:38:40,604 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 338 treesize of output 336 [2022-01-31 11:38:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 10 not checked. [2022-01-31 11:38:41,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:38:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821828205] [2022-01-31 11:38:41,049 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:38:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561782071] [2022-01-31 11:38:41,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561782071] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:38:41,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:38:41,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2022-01-31 11:38:41,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573981862] [2022-01-31 11:38:41,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:38:41,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-31 11:38:41,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:38:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-31 11:38:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=838, Unknown=21, NotChecked=130, Total=1260 [2022-01-31 11:38:41,060 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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:38:52,026 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_337 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_337)) (forall ((v_main_~i~0_334 Int) (v_ArrVal_1112 Int) (v_ArrVal_1114 Int) (v_ArrVal_1116 Int) (v_main_~i~0_336 Int)) (or (< (+ v_main_~i~0_334 1) c_~N~0) (not (<= v_main_~i~0_334 (+ v_main_~i~0_336 1))) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) c_main_~a~0.offset) v_ArrVal_1112) (+ c_main_~a~0.offset (* 4 v_main_~i~0_336)) v_ArrVal_1114) (+ (* 4 v_main_~i~0_334) c_main_~a~0.offset) v_ArrVal_1116) c_main_~a~0.offset) 2))))) (= (+ (- 1) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1) (< 3 c_~N~0)) is different from false [2022-01-31 11:38:56,102 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (< c_main_~i~0 c_~N~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_337 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_337)) (forall ((v_main_~i~0_334 Int) (v_ArrVal_1112 Int) (v_ArrVal_1114 Int) (v_ArrVal_1116 Int) (v_main_~i~0_336 Int)) (or (< (+ v_main_~i~0_334 1) c_~N~0) (not (<= v_main_~i~0_334 (+ v_main_~i~0_336 1))) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_337) c_main_~a~0.offset) v_ArrVal_1112) (+ c_main_~a~0.offset (* 4 v_main_~i~0_336)) v_ArrVal_1114) (+ (* 4 v_main_~i~0_334) c_main_~a~0.offset) v_ArrVal_1116) c_main_~a~0.offset) 2))))) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (- 1)) 1) (< 3 c_~N~0)) is different from false [2022-01-31 11:39:02,943 WARN L228 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:39:03,610 WARN L838 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 2) (= (* c_main_~i~0 4) 0)) (= c_main_~a~0.offset 0) (< 3 c_~N~0) (forall ((v_main_~i~0_334 Int) (main_~i~0 Int) (v_ArrVal_1114 Int) (v_ArrVal_1116 Int)) (or (not (<= v_main_~i~0_334 (+ main_~i~0 1))) (= 2 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1114) (+ (* 4 v_main_~i~0_334) c_main_~a~0.offset) v_ArrVal_1116) c_main_~a~0.offset)) (< (+ v_main_~i~0_334 1) c_~N~0)))) is different from false [2022-01-31 11:39:05,623 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (or (<= c_main_~i~0 1) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 2)) (< 3 c_~N~0) (forall ((v_main_~i~0_334 Int) (main_~i~0 Int) (v_ArrVal_1114 Int) (v_ArrVal_1116 Int)) (or (not (<= v_main_~i~0_334 (+ main_~i~0 1))) (= 2 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1114) (+ (* 4 v_main_~i~0_334) c_main_~a~0.offset) v_ArrVal_1116) c_main_~a~0.offset)) (< (+ v_main_~i~0_334 1) c_~N~0)))) is different from false [2022-01-31 11:39:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:07,967 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2022-01-31 11:39:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 11:39:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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 55 [2022-01-31 11:39:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:07,969 INFO L225 Difference]: With dead ends: 149 [2022-01-31 11:39:07,969 INFO L226 Difference]: Without dead ends: 149 [2022-01-31 11:39:07,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 73.5s TimeCoverageRelationStatistics Valid=555, Invalid=1887, Unknown=32, NotChecked=606, Total=3080 [2022-01-31 11:39:07,970 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 82 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:07,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 168 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 352 Invalid, 0 Unknown, 181 Unchecked, 0.2s Time] [2022-01-31 11:39:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-01-31 11:39:07,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2022-01-31 11:39:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.248) internal successors, (156), 125 states have internal predecessors, (156), 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:39:07,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2022-01-31 11:39:07,972 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 55 [2022-01-31 11:39:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:07,973 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2022-01-31 11:39:07,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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:39:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-01-31 11:39:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 11:39:07,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:07,973 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:39:07,995 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:39:08,183 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:39:08,183 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:08,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:08,184 INFO L85 PathProgramCache]: Analyzing trace with hash -127741797, now seen corresponding path program 4 times [2022-01-31 11:39:08,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:08,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945307609] [2022-01-31 11:39:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:08,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:08,193 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:39:08,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591187212] [2022-01-31 11:39:08,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:39:08,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:08,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:08,194 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:39:08,195 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:39:08,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:39:08,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:08,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 11:39:08,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:08,340 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:39:08,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:08,380 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:39:08,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:08,427 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:39:08,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:08,456 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:39:08,476 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:39:08,504 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:39:08,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:08,654 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:39:08,655 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:39:08,720 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:39:08,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:08,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945307609] [2022-01-31 11:39:08,720 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:39:08,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591187212] [2022-01-31 11:39:08,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591187212] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:08,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:39:08,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-01-31 11:39:08,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920925778] [2022-01-31 11:39:08,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:08,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:39:08,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:08,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:39:08,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:39:08,722 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:39:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:09,096 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2022-01-31 11:39:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 11:39:09,097 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 11:39:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:09,097 INFO L225 Difference]: With dead ends: 108 [2022-01-31 11:39:09,097 INFO L226 Difference]: Without dead ends: 108 [2022-01-31 11:39:09,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2022-01-31 11:39:09,098 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:09,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 275 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:39:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-31 11:39:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2022-01-31 11:39:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.1875) internal successors, (114), 96 states have internal predecessors, (114), 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:39:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2022-01-31 11:39:09,100 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 55 [2022-01-31 11:39:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:09,100 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2022-01-31 11:39:09,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:39:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2022-01-31 11:39:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:39:09,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:09,101 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:39:09,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-31 11:39:09,311 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:39:09,311 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:09,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1665838481, now seen corresponding path program 11 times [2022-01-31 11:39:09,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:09,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026276940] [2022-01-31 11:39:09,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:09,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:09,322 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:39:09,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117319475] [2022-01-31 11:39:09,322 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:39:09,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:09,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:09,323 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:39:09,342 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:39:09,485 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:39:09,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:09,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:39:09,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:39:09,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 11:39:09,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:09,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026276940] [2022-01-31 11:39:09,816 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:39:09,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117319475] [2022-01-31 11:39:09,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117319475] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:09,816 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:39:09,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-01-31 11:39:09,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660750663] [2022-01-31 11:39:09,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:09,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:39:09,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:09,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:39:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:39:09,817 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:39:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:10,099 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2022-01-31 11:39:10,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 11:39:10,100 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2022-01-31 11:39:10,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:10,101 INFO L225 Difference]: With dead ends: 136 [2022-01-31 11:39:10,101 INFO L226 Difference]: Without dead ends: 107 [2022-01-31 11:39:10,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 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:39:10,101 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 113 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:10,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 115 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:39:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-31 11:39:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2022-01-31 11:39:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.197674418604651) internal successors, (103), 86 states have internal predecessors, (103), 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:39:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-01-31 11:39:10,104 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 58 [2022-01-31 11:39:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:10,104 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-01-31 11:39:10,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:39:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-01-31 11:39:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 11:39:10,105 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:10,105 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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:39:10,127 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:39:10,321 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:39:10,321 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:10,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:10,321 INFO L85 PathProgramCache]: Analyzing trace with hash 209925325, now seen corresponding path program 12 times [2022-01-31 11:39:10,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:10,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735236460] [2022-01-31 11:39:10,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:10,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:10,332 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:39:10,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797656098] [2022-01-31 11:39:10,332 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:39:10,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:10,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:10,334 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:39:10,334 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:39:10,524 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 11:39:10,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:10,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 11:39:10,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:39:10,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:39:10,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:10,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735236460] [2022-01-31 11:39:10,863 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:39:10,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797656098] [2022-01-31 11:39:10,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797656098] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:10,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:39:10,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-01-31 11:39:10,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542015916] [2022-01-31 11:39:10,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:10,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 11:39:10,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:10,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 11:39:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-31 11:39:10,865 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 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:39:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:11,167 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2022-01-31 11:39:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:39:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 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 60 [2022-01-31 11:39:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:11,168 INFO L225 Difference]: With dead ends: 100 [2022-01-31 11:39:11,168 INFO L226 Difference]: Without dead ends: 100 [2022-01-31 11:39:11,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-01-31 11:39:11,169 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 130 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:11,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 119 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:39:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-01-31 11:39:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2022-01-31 11:39:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 77 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:39:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-01-31 11:39:11,171 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 60 [2022-01-31 11:39:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:11,171 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-01-31 11:39:11,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 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:39:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-01-31 11:39:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:39:11,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:11,172 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:39:11,188 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:39:11,386 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:39:11,386 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:11,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1580497951, now seen corresponding path program 13 times [2022-01-31 11:39:11,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:11,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400390366] [2022-01-31 11:39:11,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:11,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:11,396 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:39:11,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32915630] [2022-01-31 11:39:11,397 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:39:11,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:11,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:11,398 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:39:11,399 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:39:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:11,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-31 11:39:11,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:11,514 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:39:11,629 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:39:11,676 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:39:11,706 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:39:11,737 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:39:11,771 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:39:11,798 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:39:11,815 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:39:11,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:11,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1405) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:39:11,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1405) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:39:11,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1405) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 2)) is different from false [2022-01-31 11:39:11,879 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1405) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)) 2)) is different from false [2022-01-31 11:39:11,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1405) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 2)) is different from false [2022-01-31 11:39:11,934 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:39:11,934 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:39:11,940 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:39:11,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 40 treesize of output 40 [2022-01-31 11:39:11,943 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:39:12,056 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:39:12,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:12,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400390366] [2022-01-31 11:39:12,057 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:39:12,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32915630] [2022-01-31 11:39:12,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32915630] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:12,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:39:12,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2022-01-31 11:39:12,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790923941] [2022-01-31 11:39:12,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:12,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 11:39:12,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:12,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 11:39:12,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=319, Unknown=5, NotChecked=200, Total=600 [2022-01-31 11:39:12,058 INFO L87 Difference]: Start difference. First operand 84 states and 98 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:39:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:12,572 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-01-31 11:39:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 11:39:12,573 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:39:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:12,573 INFO L225 Difference]: With dead ends: 108 [2022-01-31 11:39:12,573 INFO L226 Difference]: Without dead ends: 108 [2022-01-31 11:39:12,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=385, Unknown=5, NotChecked=220, Total=702 [2022-01-31 11:39:12,574 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:12,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 297 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 690 Invalid, 0 Unknown, 412 Unchecked, 0.4s Time] [2022-01-31 11:39:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-01-31 11:39:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2022-01-31 11:39:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.197674418604651) internal successors, (103), 86 states have internal predecessors, (103), 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:39:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-01-31 11:39:12,577 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 63 [2022-01-31 11:39:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:12,577 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-01-31 11:39:12,577 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:39:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-01-31 11:39:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:39:12,577 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:12,577 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:39:12,596 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:39:12,795 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:39:12,795 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 971659010, now seen corresponding path program 14 times [2022-01-31 11:39:12,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:12,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641564004] [2022-01-31 11:39:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:12,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:12,805 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:39:12,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036411360] [2022-01-31 11:39:12,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:39:12,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:12,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:12,807 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:39:12,808 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:39:12,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:39:12,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:12,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 11:39:12,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:13,087 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:39:13,151 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:39:13,152 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:39:13,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:13,222 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:39:13,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:13,279 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:39:13,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:13,329 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:39:13,370 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:39:13,396 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:39:13,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:13,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1486) 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:39:13,471 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1486) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8))) 1)) is different from false [2022-01-31 11:39:13,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1486) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12))) 1)) is different from false [2022-01-31 11:39:13,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1486) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) 1)) is different from false [2022-01-31 11:39:13,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 Int) (v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (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_1483)) |c_main_~#sum~0.base| v_ArrVal_1486) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) 1)) is different from false [2022-01-31 11:39:13,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_449 Int)) (or (forall ((v_ArrVal_1483 Int) (v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (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_449)) v_ArrVal_1483)) |c_main_~#sum~0.base| v_ArrVal_1486) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_449)))) is different from false [2022-01-31 11:39:14,781 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:39:14,782 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:39:14,787 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:39:14,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-01-31 11:39:14,790 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:39:14,958 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:39:14,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:14,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641564004] [2022-01-31 11:39:14,958 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:39:14,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036411360] [2022-01-31 11:39:14,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036411360] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:14,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:39:14,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-01-31 11:39:14,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69917065] [2022-01-31 11:39:14,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:14,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 11:39:14,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 11:39:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=505, Unknown=6, NotChecked=306, Total=930 [2022-01-31 11:39:14,960 INFO L87 Difference]: Start difference. First operand 93 states and 109 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:39:17,115 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 3) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_449 Int)) (or (forall ((v_ArrVal_1483 Int) (v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (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_449)) v_ArrVal_1483)) |c_main_~#sum~0.base| v_ArrVal_1486) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_449)))) (= (+ (- 1) (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:39:19,161 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= 4 c_main_~i~0) (forall ((v_main_~i~0_449 Int)) (or (forall ((v_ArrVal_1483 Int) (v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (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_449)) v_ArrVal_1483)) |c_main_~#sum~0.base| v_ArrVal_1486) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_449)))) (= (+ (- 1) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12))) 1) (forall ((v_ArrVal_1486 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1486) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) 1))) is different from false [2022-01-31 11:39:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:19,548 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2022-01-31 11:39:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 11:39:19,548 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:39:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:19,549 INFO L225 Difference]: With dead ends: 141 [2022-01-31 11:39:19,549 INFO L226 Difference]: Without dead ends: 141 [2022-01-31 11:39:19,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 95 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=142, Invalid=638, Unknown=8, NotChecked=472, Total=1260 [2022-01-31 11:39:19,550 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:19,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 257 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 549 Invalid, 0 Unknown, 416 Unchecked, 0.4s Time] [2022-01-31 11:39:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-31 11:39:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2022-01-31 11:39:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 124 states have internal predecessors, (153), 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:39:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 159 transitions. [2022-01-31 11:39:19,553 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 159 transitions. Word has length 63 [2022-01-31 11:39:19,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:19,553 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 159 transitions. [2022-01-31 11:39:19,553 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:39:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 159 transitions. [2022-01-31 11:39:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:39:19,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:19,554 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:39:19,574 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:39:19,763 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:39:19,763 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1526356927, now seen corresponding path program 15 times [2022-01-31 11:39:19,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:19,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044655760] [2022-01-31 11:39:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:19,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:19,773 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:39:19,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098820831] [2022-01-31 11:39:19,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:39:19,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:19,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:19,774 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:39:19,775 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:39:19,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 11:39:19,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:19,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 11:39:19,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:20,159 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:39:20,221 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:39:20,222 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:39:20,327 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:39:20,327 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:39:20,423 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 11:39:20,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, 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:39:20,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:20,557 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:39:20,600 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:39:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 11:39:20,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:20,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1569) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2022-01-31 11:39:20,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1569) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2)) is different from false [2022-01-31 11:39:20,964 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_476 Int) (v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1566 Int) (v_ArrVal_1568 Int)) (or (not (<= v_main_~i~0_476 (+ c_main_~i~0 1))) (= (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_1566) (+ c_main_~a~0.offset (* 4 v_main_~i~0_476)) v_ArrVal_1568)) |c_main_~#sum~0.base| v_ArrVal_1569) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< (+ v_main_~i~0_476 1) c_~N~0))) is different from false [2022-01-31 11:39:21,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_477 Int)) (or (forall ((v_main_~i~0_476 Int) (v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1566 Int) (v_ArrVal_1568 Int)) (or (not (<= v_main_~i~0_476 (+ v_main_~i~0_477 1))) (= 2 (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_477)) v_ArrVal_1566) (+ c_main_~a~0.offset (* 4 v_main_~i~0_476)) v_ArrVal_1568)) |c_main_~#sum~0.base| v_ArrVal_1569) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) (< (+ v_main_~i~0_476 1) c_~N~0))) (not (<= v_main_~i~0_477 (+ c_main_~i~0 1))))) is different from false [2022-01-31 11:39:21,111 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_476 Int) (v_main_~i~0_477 Int) (v_ArrVal_1569 (Array Int Int)) (main_~i~0 Int) (v_ArrVal_1564 Int) (v_ArrVal_1566 Int) (v_ArrVal_1568 Int)) (or (not (<= v_main_~i~0_476 (+ v_main_~i~0_477 1))) (not (<= v_main_~i~0_477 (+ main_~i~0 1))) (= (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 (* main_~i~0 4)) v_ArrVal_1564) (+ c_main_~a~0.offset (* 4 v_main_~i~0_477)) v_ArrVal_1566) (+ c_main_~a~0.offset (* 4 v_main_~i~0_476)) v_ArrVal_1568)) |c_main_~#sum~0.base| v_ArrVal_1569) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< (+ v_main_~i~0_476 1) c_~N~0))) is different from false [2022-01-31 11:39:21,520 INFO L353 Elim1Store]: treesize reduction 216, result has 32.1 percent of original size [2022-01-31 11:39:21,520 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 118 [2022-01-31 11:39:21,551 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:39:21,551 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 113 treesize of output 173 [2022-01-31 11:39:21,562 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:39:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 25 not checked. [2022-01-31 11:39:22,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044655760] [2022-01-31 11:39:22,069 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:39:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098820831] [2022-01-31 11:39:22,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098820831] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:22,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:39:22,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2022-01-31 11:39:22,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837959098] [2022-01-31 11:39:22,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:22,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-31 11:39:22,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-31 11:39:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1048, Unknown=8, NotChecked=360, Total=1640 [2022-01-31 11:39:22,070 INFO L87 Difference]: Start difference. First operand 131 states and 159 transitions. Second operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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:39:24,242 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< 4 c_~N~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_476 Int) (v_main_~i~0_477 Int) (v_ArrVal_1569 (Array Int Int)) (main_~i~0 Int) (v_ArrVal_1564 Int) (v_ArrVal_1566 Int) (v_ArrVal_1568 Int)) (or (not (<= v_main_~i~0_476 (+ v_main_~i~0_477 1))) (not (<= v_main_~i~0_477 (+ main_~i~0 1))) (= (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 (* main_~i~0 4)) v_ArrVal_1564) (+ c_main_~a~0.offset (* 4 v_main_~i~0_477)) v_ArrVal_1566) (+ c_main_~a~0.offset (* 4 v_main_~i~0_476)) v_ArrVal_1568)) |c_main_~#sum~0.base| v_ArrVal_1569) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< (+ v_main_~i~0_476 1) c_~N~0)))) is different from false [2022-01-31 11:39:26,254 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< 4 c_~N~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_476 Int) (v_main_~i~0_477 Int) (v_ArrVal_1569 (Array Int Int)) (main_~i~0 Int) (v_ArrVal_1564 Int) (v_ArrVal_1566 Int) (v_ArrVal_1568 Int)) (or (not (<= v_main_~i~0_476 (+ v_main_~i~0_477 1))) (not (<= v_main_~i~0_477 (+ main_~i~0 1))) (= (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 (* main_~i~0 4)) v_ArrVal_1564) (+ c_main_~a~0.offset (* 4 v_main_~i~0_477)) v_ArrVal_1566) (+ c_main_~a~0.offset (* 4 v_main_~i~0_476)) v_ArrVal_1568)) |c_main_~#sum~0.base| v_ArrVal_1569) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 2) (< (+ v_main_~i~0_476 1) c_~N~0)))) is different from false [2022-01-31 11:39:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:26,831 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2022-01-31 11:39:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 11:39:26,832 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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:39:26,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:26,832 INFO L225 Difference]: With dead ends: 133 [2022-01-31 11:39:26,833 INFO L226 Difference]: Without dead ends: 133 [2022-01-31 11:39:26,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 85 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=393, Invalid=1605, Unknown=10, NotChecked=644, Total=2652 [2022-01-31 11:39:26,834 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 54 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:26,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 307 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 488 Invalid, 0 Unknown, 430 Unchecked, 0.3s Time] [2022-01-31 11:39:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-31 11:39:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2022-01-31 11:39:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 115 states have internal predecessors, (142), 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:39:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2022-01-31 11:39:26,836 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 63 [2022-01-31 11:39:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:26,836 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2022-01-31 11:39:26,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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:39:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2022-01-31 11:39:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:39:26,837 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:26,837 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:39:26,855 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:39:27,037 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:39:27,038 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash -631297664, now seen corresponding path program 16 times [2022-01-31 11:39:27,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:27,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741397625] [2022-01-31 11:39:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:27,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:27,048 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:39:27,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318687162] [2022-01-31 11:39:27,048 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:39:27,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:27,049 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:39:27,050 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:39:27,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:39:27,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:39:27,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-31 11:39:27,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:27,365 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:39:27,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:27,442 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:39:27,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:27,492 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:39:27,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:27,542 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:39:27,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:39:27,590 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:39:27,630 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:39:27,653 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:39:27,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:39:27,706 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1649) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2022-01-31 11:39:27,713 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1649) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 2)) is different from false [2022-01-31 11:39:27,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1649) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 2)) is different from false [2022-01-31 11:39:27,733 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1649) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)) 2)) is different from false [2022-01-31 11:39:27,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1649) c_main_~a~0.base) (+ c_main_~a~0.offset 16)))) is different from false [2022-01-31 11:39:27,782 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:39:27,782 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:39:27,787 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:39:27,787 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:39:27,789 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:39:27,972 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:39:27,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:27,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741397625] [2022-01-31 11:39:27,973 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:39:27,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318687162] [2022-01-31 11:39:27,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318687162] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:39:27,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:39:27,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-01-31 11:39:27,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65118885] [2022-01-31 11:39:27,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:39:27,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 11:39:27,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:39:27,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 11:39:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=550, Unknown=5, NotChecked=260, Total=930 [2022-01-31 11:39:27,975 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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:39:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:39:28,678 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2022-01-31 11:39:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:39:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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:39:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:39:28,680 INFO L225 Difference]: With dead ends: 168 [2022-01-31 11:39:28,680 INFO L226 Difference]: Without dead ends: 168 [2022-01-31 11:39:28,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=680, Unknown=5, NotChecked=290, Total=1122 [2022-01-31 11:39:28,680 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 93 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:39:28,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 345 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 773 Invalid, 0 Unknown, 356 Unchecked, 0.5s Time] [2022-01-31 11:39:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-01-31 11:39:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 128. [2022-01-31 11:39:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 121 states have internal predecessors, (148), 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:39:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2022-01-31 11:39:28,683 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 63 [2022-01-31 11:39:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:39:28,683 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2022-01-31 11:39:28,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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:39:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2022-01-31 11:39:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:39:28,683 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:39:28,683 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:39:28,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-01-31 11:39:28,884 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:39:28,884 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:39:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:39:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1920859297, now seen corresponding path program 7 times [2022-01-31 11:39:28,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:39:28,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555802826] [2022-01-31 11:39:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:39:28,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:39:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:39:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:29,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:39:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:29,713 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:39:29,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:39:29,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555802826] [2022-01-31 11:39:29,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555802826] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:39:29,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124197530] [2022-01-31 11:39:29,715 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:39:29,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:39:29,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:39:29,716 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:39:29,718 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:39:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:39:29,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-31 11:39:29,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:39:29,844 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:39:29,848 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:39:29,855 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:39:29,870 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:39:29,887 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:39:29,904 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:39:29,932 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:39:30,034 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:39:30,061 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:39:30,083 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:39: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:39:30,133 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:39:30,210 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:39:30,330 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:39:30,330 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:39:30,469 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:39:30,469 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:39:30,605 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:39:30,606 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:39:30,758 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:39:30,758 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:39:30,894 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:39:30,895 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:39:31,008 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:39:31,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:40:18,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_main_~i~0_531 Int) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_529 Int) (v_main_~i~0_527 Int) (v_main_~i~0_525 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1736))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse0 (select v_ArrVal_1736 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse3 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_531))))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_529))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_527))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse1 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_525))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (* c_~N~0 2)) (not (= .cse0 2)) (not (= 2 .cse2)) (not (= 2 .cse4)) (not (= 2 .cse1)) (not (= 2 .cse5))))))))))) is different from false [2022-01-31 11:40:35,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_1736 (Array Int Int)) (v_main_~i~0_531 Int) (v_main_~i~0_540 Int) (main_~a~0.offset Int) (v_main_~i~0_529 Int) (v_main_~i~0_527 Int) (v_main_~i~0_525 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1736))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1736 (+ main_~a~0.offset (* 4 v_main_~i~0_540)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_531))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_529))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_527))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_525))))) (or (not (= .cse0 2)) (not (= 2 .cse1)) (not (= .cse2 2)) (not (= 2 .cse3)) (not (= .cse4 2)) (= (* 2 ~N~0) (+ .cse4 .cse0 .cse2 .cse3 .cse5 .cse1))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:40:36,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_main_~i~0_531 Int) (v_main_~i~0_540 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_529 Int) (v_main_~i~0_527 Int) (v_main_~i~0_525 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1736))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1736 (+ main_~a~0.offset (* 4 v_main_~i~0_540)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_531))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_529))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_527))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_525))))) (or (not (= .cse0 2)) (not (= 2 .cse1)) (not (= .cse2 2)) (not (= 2 .cse3)) (not (= .cse4 2)) (= (* 2 ~N~0) (+ .cse4 .cse0 .cse2 .cse3 .cse5 .cse1)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0)))))))))) is different from false [2022-01-31 11:40:40,733 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_main_~i~0_531 Int) (v_main_~i~0_540 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_529 Int) (v_main_~i~0_527 Int) (v_main_~i~0_525 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1736))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1736 (+ main_~a~0.offset (* 4 v_main_~i~0_540)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_531))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_529))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_527))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_525))))) (or (not (= .cse0 2)) (not (= 2 .cse1)) (< (+ c_main_~i~0 3) ~N~0) (not (= .cse2 2)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= 2 .cse3)) (not (= .cse4 2)) (= (* 2 ~N~0) (+ .cse4 .cse0 .cse2 .cse3 .cse5 .cse1))))))))))) is different from false [2022-01-31 11:40:45,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_main_~i~0_531 Int) (v_main_~i~0_540 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_529 Int) (v_main_~i~0_527 Int) (v_main_~i~0_525 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1736))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1736 (+ main_~a~0.offset (* 4 v_main_~i~0_540)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_531))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_529))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_527))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_525))))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= .cse0 2)) (not (= 2 .cse1)) (not (= .cse2 2)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= 2 .cse3)) (not (= .cse4 2)) (= (* 2 ~N~0) (+ .cse4 .cse0 .cse2 .cse3 .cse5 .cse1))))))))))) is different from false [2022-01-31 11:40:49,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_main_~i~0_531 Int) (v_main_~i~0_540 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_529 Int) (v_main_~i~0_527 Int) (v_main_~i~0_525 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1736))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_1736 (+ main_~a~0.offset (* 4 v_main_~i~0_540)))) (.cse5 (select .cse7 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_531))))) (let ((.cse0 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_529))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_527))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse4 .cse0 .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_525))))) (or (not (= .cse0 2)) (not (= 2 .cse1)) (< (+ c_main_~i~0 5) ~N~0) (not (= .cse2 2)) (not (= 2 .cse3)) (not (= .cse4 2)) (not (< (+ c_main_~i~0 4) ~N~0)) (= (* 2 ~N~0) (+ .cse4 .cse0 .cse2 .cse3 .cse5 .cse1))))))))))) is different from false [2022-01-31 11:40:52,622 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:40:52,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124197530] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:40:52,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:40:52,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23, 24] total 62 [2022-01-31 11:40:52,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641628091] [2022-01-31 11:40:52,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:40:52,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-01-31 11:40:52,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:40:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-01-31 11:40:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2874, Unknown=26, NotChecked=678, Total=3782 [2022-01-31 11:40:52,623 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand has 62 states, 60 states have (on average 1.75) internal successors, (105), 59 states have internal predecessors, (105), 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:40:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:40:58,479 INFO L93 Difference]: Finished difference Result 197 states and 236 transitions. [2022-01-31 11:40:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 11:40:58,480 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 60 states have (on average 1.75) internal successors, (105), 59 states have internal predecessors, (105), 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:40:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:40:58,480 INFO L225 Difference]: With dead ends: 197 [2022-01-31 11:40:58,480 INFO L226 Difference]: Without dead ends: 193 [2022-01-31 11:40:58,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 106 SyntacticMatches, 12 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 49.8s TimeCoverageRelationStatistics Valid=334, Invalid=4356, Unknown=26, NotChecked=834, Total=5550 [2022-01-31 11:40:58,481 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1133 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:40:58,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 358 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 572 Invalid, 0 Unknown, 1133 Unchecked, 0.3s Time] [2022-01-31 11:40:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-31 11:40:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2022-01-31 11:40:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 179 states have (on average 1.217877094972067) internal successors, (218), 179 states have internal predecessors, (218), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:40:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 224 transitions. [2022-01-31 11:40:58,484 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 224 transitions. Word has length 63 [2022-01-31 11:40:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:40:58,484 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 224 transitions. [2022-01-31 11:40:58,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 60 states have (on average 1.75) internal successors, (105), 59 states have internal predecessors, (105), 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:40:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 224 transitions. [2022-01-31 11:40:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 11:40:58,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:40:58,485 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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:40:58,502 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:40:58,694 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:40:58,695 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:40:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:40:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1860755935, now seen corresponding path program 5 times [2022-01-31 11:40:58,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:40:58,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305277506] [2022-01-31 11:40:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:40:58,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:40:58,704 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:40:58,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395239451] [2022-01-31 11:40:58,705 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:40:58,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:40:58,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:40:58,706 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:40:58,706 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:40:59,028 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 11:40:59,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:40:59,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-31 11:40:59,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:40:59,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:40:59,106 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:40:59,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, 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:40:59,134 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:40:59,134 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:40:59,161 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:40:59,161 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:40:59,190 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:40:59,190 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:40:59,209 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:40:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:40:59,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:40:59,458 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:40:59,460 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:40:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 11:40:59,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:40:59,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305277506] [2022-01-31 11:40:59,496 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:40:59,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395239451] [2022-01-31 11:40:59,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395239451] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:40:59,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:40:59,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2022-01-31 11:40:59,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120516665] [2022-01-31 11:40:59,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:40:59,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 11:40:59,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:40:59,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 11:40:59,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:40:59,497 INFO L87 Difference]: Start difference. First operand 186 states and 224 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 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:40:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:40:59,946 INFO L93 Difference]: Finished difference Result 168 states and 195 transitions. [2022-01-31 11:40:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:40:59,947 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 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 63 [2022-01-31 11:40:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:40:59,947 INFO L225 Difference]: With dead ends: 168 [2022-01-31 11:40:59,947 INFO L226 Difference]: Without dead ends: 168 [2022-01-31 11:40:59,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-01-31 11:40:59,948 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:40:59,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 240 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 11:40:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-01-31 11:40:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2022-01-31 11:40:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.1753246753246753) internal successors, (181), 154 states have internal predecessors, (181), 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:40:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2022-01-31 11:40:59,950 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 63 [2022-01-31 11:40:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:40:59,950 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2022-01-31 11:40:59,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 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:40:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2022-01-31 11:40:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 11:40:59,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:40:59,951 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:40:59,969 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:41:00,158 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:41:00,159 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:00,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1281288795, now seen corresponding path program 8 times [2022-01-31 11:41:00,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:00,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36656145] [2022-01-31 11:41:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:00,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:41:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:41:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:00,366 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:41:00,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:00,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36656145] [2022-01-31 11:41:00,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36656145] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:41:00,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005719300] [2022-01-31 11:41:00,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:41:00,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:00,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:00,368 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:41:00,369 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:41:00,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:41:00,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:00,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 11:41:00,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:00,708 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:41:00,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:00,853 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:41:00,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005719300] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:00,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:41:00,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 11:41:00,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812693060] [2022-01-31 11:41:00,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:00,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 11:41:00,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 11:41:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 11:41:00,854 INFO L87 Difference]: Start difference. First operand 161 states and 187 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:41:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:01,526 INFO L93 Difference]: Finished difference Result 159 states and 186 transitions. [2022-01-31 11:41:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 11:41:01,527 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:41:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:01,527 INFO L225 Difference]: With dead ends: 159 [2022-01-31 11:41:01,527 INFO L226 Difference]: Without dead ends: 159 [2022-01-31 11:41:01,528 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:41:01,528 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 166 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:01,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 58 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 11:41:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-01-31 11:41:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 125. [2022-01-31 11:41:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 118 states have (on average 1.152542372881356) internal successors, (136), 118 states have internal predecessors, (136), 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:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2022-01-31 11:41:01,530 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 65 [2022-01-31 11:41:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:01,530 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2022-01-31 11:41:01,530 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:41:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2022-01-31 11:41:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 11:41:01,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:01,531 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, 1] [2022-01-31 11:41:01,548 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:41:01,745 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:41:01,746 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash 476560269, now seen corresponding path program 17 times [2022-01-31 11:41:01,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:01,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987771289] [2022-01-31 11:41:01,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:01,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:01,774 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:01,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367176720] [2022-01-31 11:41:01,774 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:41:01,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:01,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:01,780 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:41:01,781 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:41:02,029 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-31 11:41:02,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:02,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 11:41:02,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:41:02,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 11:41:02,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:02,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987771289] [2022-01-31 11:41:02,422 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:02,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367176720] [2022-01-31 11:41:02,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367176720] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:02,422 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:02,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-01-31 11:41:02,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222050300] [2022-01-31 11:41:02,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:02,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 11:41:02,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 11:41:02,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-01-31 11:41:02,423 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 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:41:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:02,730 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2022-01-31 11:41:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:41:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 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 66 [2022-01-31 11:41:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:02,732 INFO L225 Difference]: With dead ends: 131 [2022-01-31 11:41:02,732 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 11:41:02,732 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:41:02,732 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 135 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:02,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 89 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:41:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 11:41:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-01-31 11:41:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 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:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2022-01-31 11:41:02,734 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 66 [2022-01-31 11:41:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:02,734 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2022-01-31 11:41:02,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 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:41:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2022-01-31 11:41:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:41:02,735 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:02,735 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:41:02,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-01-31 11:41:02,947 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:41:02,947 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:02,948 INFO L85 PathProgramCache]: Analyzing trace with hash -904204827, now seen corresponding path program 18 times [2022-01-31 11:41:02,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:02,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357220374] [2022-01-31 11:41:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:02,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:02,958 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:02,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703182659] [2022-01-31 11:41:02,958 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:41:02,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:02,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:02,960 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:41:02,960 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:41:03,985 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 11:41:03,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:03,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-31 11:41:03,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:04,004 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,044 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:41:04,079 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:41:04,079 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 30 treesize of output 29 [2022-01-31 11:41:04,106 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:41:04,106 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 30 treesize of output 29 [2022-01-31 11:41:04,142 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:41:04,143 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 30 treesize of output 29 [2022-01-31 11:41:04,229 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 11:41:04,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, 1 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:41:04,354 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:41:04,405 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:04,405 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:41:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 20 proven. 81 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-31 11:41:04,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:04,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_2085 (Array Int Int))) (let ((.cse0 (+ 5 main_~i~0))) (or (< c_~N~0 .cse0) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 2) (< .cse0 c_~N~0)))) is different from false [2022-01-31 11:41:05,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2085 (Array Int 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_2084)) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2) (<= (+ 5 v_main_~i~0_642) c_main_~i~0) (< c_main_~i~0 (+ 4 v_main_~i~0_642)))) is different from false [2022-01-31 11:41:05,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) 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_2084)) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) is different from false [2022-01-31 11:41:05,263 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) c_main_~i~0) (= 2 (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_2081) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) is different from false [2022-01-31 11:41:05,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (= 2 (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_2081) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) is different from false [2022-01-31 11:41:05,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (= 2 (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_2079) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) is different from false [2022-01-31 11:41:05,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 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 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2) (<= (+ 2 v_main_~i~0_642) c_main_~i~0))) is different from false [2022-01-31 11:41:05,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) is different from false [2022-01-31 11:41:05,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (<= (+ v_main_~i~0_642 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_642) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 16) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) is different from false [2022-01-31 11:41:05,655 INFO L353 Elim1Store]: treesize reduction 536, result has 11.1 percent of original size [2022-01-31 11:41:05,655 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 6 case distinctions, treesize of input 81 treesize of output 85 [2022-01-31 11:41:05,666 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-01-31 11:41:05,666 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:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 37 trivial. 55 not checked. [2022-01-31 11:41:05,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:05,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357220374] [2022-01-31 11:41:05,708 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:05,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703182659] [2022-01-31 11:41:05,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703182659] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:05,708 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:05,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 38 [2022-01-31 11:41:05,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302137445] [2022-01-31 11:41:05,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:05,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 11:41:05,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:05,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 11:41:05,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=716, Unknown=19, NotChecked=558, Total=1406 [2022-01-31 11:41:05,714 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 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,598 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (<= (+ v_main_~i~0_642 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_642) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 16) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (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:07,357 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select (select |c_#memory_int| 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:08,121 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (= |c_main_#t~mem8| (select .cse1 (+ .cse2 c_main_~a~0.offset))))) is different from false [2022-01-31 11:41:09,432 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (<= (+ v_main_~i~0_642 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_642) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 16) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse1 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse1 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse1 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2) (<= (+ 2 v_main_~i~0_642) c_main_~i~0))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse2 (+ .cse3 c_main_~a~0.offset (- 4)))) 1) (= (+ (- 1) (select .cse2 (+ .cse3 c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:41:10,734 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (= 2 (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) v_ArrVal_2079) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1))) is different from false [2022-01-31 11:41:12,015 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (= 2 (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) v_ArrVal_2079) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (= |c_main_#t~mem8| (select .cse1 (+ .cse2 c_main_~a~0.offset))))) is different from false [2022-01-31 11:41:13,834 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (<= (+ v_main_~i~0_642 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_642) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 16) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (= (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_2079) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2) (<= (+ 2 v_main_~i~0_642) c_main_~i~0))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse4 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:41:15,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (= 2 (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) v_ArrVal_2079) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset) v_ArrVal_2081) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (= 1 (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 12))))))) is different from false [2022-01-31 11:41:17,263 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (= 2 (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) v_ArrVal_2079) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset) v_ArrVal_2081) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (= |c_main_#t~mem8| (select .cse1 (+ .cse2 c_main_~a~0.offset))) (= 1 (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 12))))))) is different from false [2022-01-31 11:41:19,271 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (<= (+ v_main_~i~0_642 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_642) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 16) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (= (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_2079) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2) (<= (+ 2 v_main_~i~0_642) c_main_~i~0))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) 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_2084)) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse4 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset))) 1) (= 1 (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 12))))))) is different from false [2022-01-31 11:41:21,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (= 2 (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) v_ArrVal_2079) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset) v_ArrVal_2081) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (= 1 (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 12))))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2085 (Array Int 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_2084)) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2) (<= (+ 5 v_main_~i~0_642) c_main_~i~0) (< c_main_~i~0 (+ 4 v_main_~i~0_642)))) (= (+ (- 1) (select .cse1 (+ .cse2 (- 16) c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:41:23,093 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (= 2 (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) v_ArrVal_2079) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset) v_ArrVal_2081) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (= |c_main_#t~mem8| (select .cse1 (+ .cse2 c_main_~a~0.offset))) (= 1 (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 12))))) (= (+ (- 1) (select .cse1 (+ .cse2 (- 16) c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:41:25,101 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (<= (+ v_main_~i~0_642 1) c_main_~i~0) (< c_main_~i~0 v_main_~i~0_642) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 16) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (= (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_2079) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2) (<= (+ 2 v_main_~i~0_642) c_main_~i~0))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) 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_2084)) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse4 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset))) 1) (= 1 (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 12))))) (= (+ (- 1) (select .cse1 (+ .cse2 (- 16) c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:41:27,173 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (* c_main_~i~0 4))) (and (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2077 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ v_main_~i~0_642 1)) (<= (+ 2 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse0 (* c_main_~i~0 4))) (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset) v_ArrVal_2077) (+ .cse0 c_main_~a~0.offset 4) v_ArrVal_2079) (+ .cse0 c_main_~a~0.offset 8) v_ArrVal_2081) (+ .cse0 c_main_~a~0.offset 12) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 8)))) 1) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2079 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (= 2 (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) v_ArrVal_2079) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_2081) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))) (< c_main_~i~0 (+ 2 v_main_~i~0_642)) (<= (+ 3 v_main_~i~0_642) c_main_~i~0))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2081 Int) (v_ArrVal_2085 (Array Int Int))) (or (< c_main_~i~0 (+ 3 v_main_~i~0_642)) (<= (+ 4 v_main_~i~0_642) c_main_~i~0) (= 2 (select (select (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse4 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset) v_ArrVal_2081) (+ .cse4 c_main_~a~0.offset 4) v_ArrVal_2084))) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 4)))) 1) (= 1 (+ (- 1) (select .cse1 (+ .cse2 c_main_~a~0.offset (- 12))))) (exists ((v_main_~i~0_628 Int)) (and (< v_main_~i~0_628 c_~N~0) (<= c_main_~i~0 (+ v_main_~i~0_628 1)) (= (+ (- 1) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_628) (- 16) c_main_~a~0.offset))) 1))) (forall ((v_ArrVal_2084 Int) (v_main_~i~0_642 Int) (v_ArrVal_2085 (Array Int 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_2084)) |c_main_~#sum~0.base| v_ArrVal_2085) c_main_~a~0.base) (+ (* 4 v_main_~i~0_642) c_main_~a~0.offset)) 2) (<= (+ 5 v_main_~i~0_642) c_main_~i~0) (< c_main_~i~0 (+ 4 v_main_~i~0_642)))) (= (+ (- 1) (select .cse1 (+ .cse2 (- 16) c_main_~a~0.offset))) 1))) is different from false [2022-01-31 11:41:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:29,998 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2022-01-31 11:41:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 11:41:29,999 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 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:41:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:29,999 INFO L225 Difference]: With dead ends: 110 [2022-01-31 11:41:29,999 INFO L226 Difference]: Without dead ends: 110 [2022-01-31 11:41:30,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 23 IntricatePredicates, 2 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=180, Invalid=935, Unknown=33, NotChecked=1932, Total=3080 [2022-01-31 11:41:30,000 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:30,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 350 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 237 Invalid, 0 Unknown, 329 Unchecked, 0.2s Time] [2022-01-31 11:41:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-01-31 11:41:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2022-01-31 11:41:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 101 states have internal predecessors, (122), 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:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-01-31 11:41:30,002 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 71 [2022-01-31 11:41:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:30,002 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-01-31 11:41:30,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 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:30,002 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-01-31 11:41:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:41:30,003 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:30,003 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:41:30,022 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:41:30,222 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:41:30,222 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:30,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1647952134, now seen corresponding path program 19 times [2022-01-31 11:41:30,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:30,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442987227] [2022-01-31 11:41:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:30,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:30,233 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:30,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972290628] [2022-01-31 11:41:30,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 11:41:30,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:30,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:30,235 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:41:30,236 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:41:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:41:30,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-31 11:41:30,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:30,385 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:30,500 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:41:30,551 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:41:30,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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:41:30,600 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:30,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, 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:30,662 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:30,703 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:30,731 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:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 23 proven. 77 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-31 11:41:30,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:30,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2180) 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:30,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 2)) is different from false [2022-01-31 11:41:30,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:41:30,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)) 2)) is different from false [2022-01-31 11:41:30,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 2)) is different from false [2022-01-31 11:41:30,856 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2176 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_2176)) |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 2)) is different from false [2022-01-31 11:41:30,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_673 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_673)) (forall ((v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2176 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_673) c_main_~a~0.offset) v_ArrVal_2176)) |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 2)))) is different from false [2022-01-31 11:41:30,946 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 11:41:30,946 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:41:30,954 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:30,954 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:41:30,957 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:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 38 trivial. 51 not checked. [2022-01-31 11:41:31,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:31,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442987227] [2022-01-31 11:41:31,056 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:31,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972290628] [2022-01-31 11:41:31,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972290628] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:31,056 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:31,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2022-01-31 11:41:31,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599013886] [2022-01-31 11:41:31,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:31,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 11:41:31,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:31,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 11:41:31,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=395, Unknown=7, NotChecked=322, Total=812 [2022-01-31 11:41:31,057 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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:41:33,239 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_673 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_673)) (forall ((v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2176 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_673) c_main_~a~0.offset) v_ArrVal_2176)) |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 2)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1) (= c_main_~i~0 4)) is different from false [2022-01-31 11:41:35,275 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_673 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_673)) (forall ((v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2176 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_673) c_main_~a~0.offset) v_ArrVal_2176)) |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 2)))) (= 2 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 16))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_ArrVal_2180 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2180) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) 2))) is different from false [2022-01-31 11:41:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:35,602 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2022-01-31 11:41:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 11:41:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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 71 [2022-01-31 11:41:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:35,608 INFO L225 Difference]: With dead ends: 157 [2022-01-31 11:41:35,608 INFO L226 Difference]: Without dead ends: 157 [2022-01-31 11:41:35,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 110 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=115, Invalid=512, Unknown=9, NotChecked=486, Total=1122 [2022-01-31 11:41:35,609 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 584 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:35,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 343 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 702 Invalid, 0 Unknown, 584 Unchecked, 0.4s Time] [2022-01-31 11:41:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-01-31 11:41:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-01-31 11:41:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 133 states have (on average 1.2330827067669172) internal successors, (164), 133 states have internal predecessors, (164), 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:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2022-01-31 11:41:35,611 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 71 [2022-01-31 11:41:35,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:35,611 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2022-01-31 11:41:35,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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:41:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2022-01-31 11:41:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:41:35,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:35,611 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:41:35,629 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:41:35,829 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:41:35,829 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash 892746532, now seen corresponding path program 20 times [2022-01-31 11:41:35,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:35,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92064451] [2022-01-31 11:41:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:35,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:35,840 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:35,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348960435] [2022-01-31 11:41:35,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:41:35,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:35,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:35,842 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:41:35,843 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:41:35,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:41:35,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:35,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 11:41:35,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:36,159 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:36,243 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:41:36,243 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:41:36,314 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:41:36,314 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:41:36,372 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:41:36,372 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:41:36,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:36,452 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:36,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:41:36,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, 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:36,542 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:41:36,573 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:41:36,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:36,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2276 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2022-01-31 11:41:36,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2276 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2276) 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:36,655 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2276 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:41:36,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2273 Int) (v_ArrVal_2276 (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_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2)) is different from false [2022-01-31 11:41:36,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_701 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_701)) (forall ((v_ArrVal_2273 Int) (v_ArrVal_2276 (Array Int Int))) (= 2 (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_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))) is different from false [2022-01-31 11:41:36,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_701)) (= (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_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2))) is different from false [2022-01-31 11:41:36,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_702 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_702)) (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= 2 (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_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))) is different from false [2022-01-31 11:41:36,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2269 Int) (v_main_~i~0_702 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= (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_2269) (+ c_main_~a~0.offset (* 4 v_main_~i~0_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2) (not (<= (+ c_main_~i~0 1) v_main_~i~0_702)))) is different from false [2022-01-31 11:41:36,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_703 Int)) (or (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2269 Int) (v_main_~i~0_702 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_703 1) v_main_~i~0_702)) (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_703) c_main_~a~0.offset) v_ArrVal_2269) (+ c_main_~a~0.offset (* 4 v_main_~i~0_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_703)))) is different from false [2022-01-31 11:41:37,133 INFO L353 Elim1Store]: treesize reduction 267, result has 16.0 percent of original size [2022-01-31 11:41:37,134 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:41:37,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:37,143 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:41:37,145 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:37,283 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:41:37,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:37,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92064451] [2022-01-31 11:41:37,284 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:37,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348960435] [2022-01-31 11:41:37,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348960435] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:37,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:37,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2022-01-31 11:41:37,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182396491] [2022-01-31 11:41:37,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:37,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 11:41:37,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:37,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 11:41:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=460, Unknown=9, NotChecked=468, Total=1056 [2022-01-31 11:41:37,285 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 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:39,385 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_703 Int)) (or (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2269 Int) (v_main_~i~0_702 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_703 1) v_main_~i~0_702)) (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_703) c_main_~a~0.offset) v_ArrVal_2269) (+ c_main_~a~0.offset (* 4 v_main_~i~0_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_703)))) (= (+ (- 1) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1) (= (+ c_main_~i~0 (- 2)) 0)) is different from false [2022-01-31 11:41:41,431 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (- 1)) 1) (forall ((v_main_~i~0_702 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_702)) (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= 2 (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_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_703 Int)) (or (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2269 Int) (v_main_~i~0_702 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_703 1) v_main_~i~0_702)) (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_703) c_main_~a~0.offset) v_ArrVal_2269) (+ c_main_~a~0.offset (* 4 v_main_~i~0_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_703)))) (<= 3 c_main_~i~0)) is different from false [2022-01-31 11:41:43,441 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (- 1)) 1) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= 4 c_main_~i~0) (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_701)) (= (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_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2))) (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2269 Int) (v_main_~i~0_702 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= (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_2269) (+ c_main_~a~0.offset (* 4 v_main_~i~0_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2) (not (<= (+ c_main_~i~0 1) v_main_~i~0_702))))) is different from false [2022-01-31 11:41:45,450 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (- 1)) 1) (forall ((v_main_~i~0_702 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_702)) (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= 2 (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_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= 4 c_main_~i~0) (forall ((v_main_~i~0_701 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_701)) (forall ((v_ArrVal_2273 Int) (v_ArrVal_2276 (Array Int Int))) (= 2 (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_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))) is different from false [2022-01-31 11:41:47,502 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (- 1)) 1) (forall ((v_ArrVal_2276 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= 4 c_main_~i~0) (forall ((v_main_~i~0_703 Int)) (or (forall ((v_ArrVal_2271 Int) (v_ArrVal_2273 Int) (v_ArrVal_2269 Int) (v_main_~i~0_702 Int) (v_ArrVal_2276 (Array Int Int)) (v_main_~i~0_701 Int)) (or (not (<= (+ v_main_~i~0_703 1) v_main_~i~0_702)) (not (<= (+ v_main_~i~0_702 1) v_main_~i~0_701)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_703) c_main_~a~0.offset) v_ArrVal_2269) (+ c_main_~a~0.offset (* 4 v_main_~i~0_702)) v_ArrVal_2271) (+ (* 4 v_main_~i~0_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 2))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_703)))) (forall ((v_main_~i~0_701 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_701)) (forall ((v_ArrVal_2273 Int) (v_ArrVal_2276 (Array Int Int))) (= 2 (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_701) c_main_~a~0.offset) v_ArrVal_2273)) |c_main_~#sum~0.base| v_ArrVal_2276) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))) is different from false [2022-01-31 11:41:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:41:47,774 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2022-01-31 11:41:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:41:47,775 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 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:41:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:41:47,776 INFO L225 Difference]: With dead ends: 150 [2022-01-31 11:41:47,776 INFO L226 Difference]: Without dead ends: 150 [2022-01-31 11:41:47,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=140, Invalid=502, Unknown=14, NotChecked=826, Total=1482 [2022-01-31 11:41:47,777 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 86 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 476 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:41:47,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 321 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 377 Invalid, 0 Unknown, 476 Unchecked, 0.3s Time] [2022-01-31 11:41:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-01-31 11:41:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 112. [2022-01-31 11:41:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.2) internal successors, (126), 105 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:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2022-01-31 11:41:47,779 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 71 [2022-01-31 11:41:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:41:47,779 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2022-01-31 11:41:47,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 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:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2022-01-31 11:41:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:41:47,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:41:47,779 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:41:47,798 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:41:47,987 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:41:47,987 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:41:47,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:41:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash -966121790, now seen corresponding path program 21 times [2022-01-31 11:41:47,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:41:47,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180601172] [2022-01-31 11:41:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:41:47,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:41:47,998 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:41:47,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289807626] [2022-01-31 11:41:47,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:41:47,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:41:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:41:47,999 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:41:48,002 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:41:48,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 11:41:48,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:41:48,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 11:41:48,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:41:48,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 10 treesize of output 8 [2022-01-31 11:41:48,422 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:41:48,472 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:41:48,472 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 27 treesize of output 26 [2022-01-31 11:41:48,509 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:41:48,510 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 27 treesize of output 26 [2022-01-31 11:41:48,555 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:41:48,555 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 27 treesize of output 26 [2022-01-31 11:41:48,604 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:41:48,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-31 11:41:48,657 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:48,693 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:41:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-01-31 11:41:48,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:41:48,786 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2374 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2374) 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:48,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2374 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 11:41:48,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2372 Int) (v_ArrVal_2374 (Array Int Int))) (= (+ (- 1) (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_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 11:41:48,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_728 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_728)) (forall ((v_ArrVal_2372 Int) (v_ArrVal_2374 (Array Int Int))) (= (+ (- 1) (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_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)))) is different from false [2022-01-31 11:41:48,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_728)) (= (+ (- 1) (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_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) is different from false [2022-01-31 11:41:48,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_729 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_729)) (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (= (+ (- 1) (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_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))))) is different from false [2022-01-31 11:41:48,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_729)) (= (+ (- 1) (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_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) is different from false [2022-01-31 11:41:49,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_730 Int)) (or (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)) (= (+ (- 1) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_730)))) is different from false [2022-01-31 11:41:49,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2371 Int) (v_main_~i~0_730 Int) (v_ArrVal_2372 Int) (v_ArrVal_2366 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_730)) (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)) (= 1 (+ (- 1) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_2366) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))) is different from false [2022-01-31 11:41:49,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_731 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_731)) (forall ((v_ArrVal_2371 Int) (v_main_~i~0_730 Int) (v_ArrVal_2372 Int) (v_ArrVal_2366 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_731 1) v_main_~i~0_730)) (= (+ (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_731)) v_ArrVal_2366) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)))))) is different from false [2022-01-31 11:41:49,666 INFO L353 Elim1Store]: treesize reduction 484, result has 11.5 percent of original size [2022-01-31 11:41:49,666 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 6 case distinctions, treesize of input 77 treesize of output 81 [2022-01-31 11:41:49,674 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:41:49,674 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:49,677 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:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 51 not checked. [2022-01-31 11:41:49,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:41:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180601172] [2022-01-31 11:41:49,742 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:41:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289807626] [2022-01-31 11:41:49,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289807626] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:41:49,743 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:41:49,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 29 [2022-01-31 11:41:49,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971352139] [2022-01-31 11:41:49,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:41:49,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 11:41:49,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:41:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 11:41:49,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=281, Unknown=10, NotChecked=430, Total=812 [2022-01-31 11:41:49,744 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 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:41:51,821 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (+ (- 1) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) 1) (forall ((v_main_~i~0_731 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_731)) (forall ((v_ArrVal_2371 Int) (v_main_~i~0_730 Int) (v_ArrVal_2372 Int) (v_ArrVal_2366 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_731 1) v_main_~i~0_730)) (= (+ (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_731)) v_ArrVal_2366) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729))))))) is different from false [2022-01-31 11:41:53,858 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_main_~i~0_730 Int)) (or (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)) (= (+ (- 1) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_730)))) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (forall ((v_main_~i~0_731 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_731)) (forall ((v_ArrVal_2371 Int) (v_main_~i~0_730 Int) (v_ArrVal_2372 Int) (v_ArrVal_2366 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_731 1) v_main_~i~0_730)) (= (+ (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_731)) v_ArrVal_2366) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729))))))) is different from false [2022-01-31 11:41:55,910 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_main_~i~0_730 Int)) (or (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)) (= (+ (- 1) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_730)))) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (forall ((v_main_~i~0_729 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_729)) (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (= (+ (- 1) (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_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))))) (forall ((v_main_~i~0_731 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_731)) (forall ((v_ArrVal_2371 Int) (v_main_~i~0_730 Int) (v_ArrVal_2372 Int) (v_ArrVal_2366 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_731 1) v_main_~i~0_730)) (= (+ (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_731)) v_ArrVal_2366) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)))))) (<= 3 c_main_~i~0)) is different from false [2022-01-31 11:41:57,973 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_main_~i~0_730 Int)) (or (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)) (= (+ (- 1) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_730)))) (<= 4 c_main_~i~0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (forall ((v_main_~i~0_729 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_729)) (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (= (+ (- 1) (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_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))))) (forall ((v_main_~i~0_731 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_731)) (forall ((v_ArrVal_2371 Int) (v_main_~i~0_730 Int) (v_ArrVal_2372 Int) (v_ArrVal_2366 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_731 1) v_main_~i~0_730)) (= (+ (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_731)) v_ArrVal_2366) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)))))) (forall ((v_main_~i~0_728 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_728)) (forall ((v_ArrVal_2372 Int) (v_ArrVal_2374 (Array Int Int))) (= (+ (- 1) (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_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))))) is different from false [2022-01-31 11:42:00,047 WARN L838 $PredicateComparison]: unable to prove that (and (<= 5 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_main_~i~0_730 Int)) (or (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)) (= (+ (- 1) (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_730)))) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (forall ((v_main_~i~0_729 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_729)) (forall ((v_ArrVal_2371 Int) (v_ArrVal_2372 Int) (v_main_~i~0_728 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (= (+ (- 1) (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_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))))) (forall ((v_main_~i~0_731 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_731)) (forall ((v_ArrVal_2371 Int) (v_main_~i~0_730 Int) (v_ArrVal_2372 Int) (v_ArrVal_2366 Int) (v_main_~i~0_728 Int) (v_main_~i~0_729 Int) (v_ArrVal_2369 Int) (v_ArrVal_2374 (Array Int Int))) (or (not (<= (+ v_main_~i~0_729 1) v_main_~i~0_728)) (not (<= (+ v_main_~i~0_731 1) v_main_~i~0_730)) (= (+ (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_731)) v_ArrVal_2366) (+ (* 4 v_main_~i~0_730) c_main_~a~0.offset) v_ArrVal_2369) (+ c_main_~a~0.offset (* 4 v_main_~i~0_729)) v_ArrVal_2371) (+ c_main_~a~0.offset (* 4 v_main_~i~0_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (- 1)) 1) (not (<= (+ v_main_~i~0_730 1) v_main_~i~0_729)))))) (forall ((v_main_~i~0_728 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_728)) (forall ((v_ArrVal_2372 Int) (v_ArrVal_2374 (Array Int Int))) (= (+ (- 1) (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_728)) v_ArrVal_2372)) |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1)))) (forall ((v_ArrVal_2374 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2374) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) 1))) is different from false [2022-01-31 11:42:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:42:00,300 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2022-01-31 11:42:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 11:42:00,301 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 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 71 [2022-01-31 11:42:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:42:00,301 INFO L225 Difference]: With dead ends: 113 [2022-01-31 11:42:00,301 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 11:42:00,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 110 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=110, Invalid=315, Unknown=15, NotChecked=750, Total=1190 [2022-01-31 11:42:00,302 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:42:00,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 312 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 400 Invalid, 0 Unknown, 509 Unchecked, 0.3s Time] [2022-01-31 11:42:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 11:42:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-01-31 11:42:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 105 states have internal predecessors, (123), 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:42:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2022-01-31 11:42:00,304 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 71 [2022-01-31 11:42:00,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:42:00,304 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2022-01-31 11:42:00,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 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:42:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2022-01-31 11:42:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:42:00,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:42:00,305 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:42:00,323 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:42:00,522 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:42:00,523 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:42:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:42:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash -557297565, now seen corresponding path program 22 times [2022-01-31 11:42:00,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:42:00,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325299867] [2022-01-31 11:42:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:42:00,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:42:00,537 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:42:00,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1506089903] [2022-01-31 11:42:00,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:42:00,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:42:00,542 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:42:00,543 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:42:00,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:42:00,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:42:00,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-31 11:42:00,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:42:00,948 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:42:01,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,030 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:42:01,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,083 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:42:01,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,135 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:42:01,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,190 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:42:01,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:01,244 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:42:01,291 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:42:01,316 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:42:01,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:42:01,376 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2467 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2467) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:42:01,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2467 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2467) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 11:42:01,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2467 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2467) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 2)) is different from false [2022-01-31 11:42:01,399 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2467 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2467) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)) 2)) is different from false [2022-01-31 11:42:01,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2467 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2467) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 20)))) is different from false [2022-01-31 11:42:01,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2467 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2467) c_main_~a~0.base) (+ c_main_~a~0.offset 20)))) is different from false [2022-01-31 11:42:01,464 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:42:01,464 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:42:01,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:42:01,468 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:42:01,471 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:42:01,707 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:42:01,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:42:01,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325299867] [2022-01-31 11:42:01,707 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:42:01,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506089903] [2022-01-31 11:42:01,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506089903] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:42:01,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:42:01,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2022-01-31 11:42:01,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166530182] [2022-01-31 11:42:01,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:42:01,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 11:42:01,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:42:01,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 11:42:01,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=697, Unknown=6, NotChecked=354, Total=1190 [2022-01-31 11:42:01,708 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 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:42:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:42:02,677 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2022-01-31 11:42:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 11:42:02,677 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 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:42:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:42:02,678 INFO L225 Difference]: With dead ends: 182 [2022-01-31 11:42:02,678 INFO L226 Difference]: Without dead ends: 182 [2022-01-31 11:42:02,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=845, Unknown=6, NotChecked=390, Total=1406 [2022-01-31 11:42:02,679 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 93 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 521 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 11:42:02,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 436 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1109 Invalid, 0 Unknown, 521 Unchecked, 0.7s Time] [2022-01-31 11:42:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-01-31 11:42:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 127. [2022-01-31 11:42:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 120 states have (on average 1.1583333333333334) internal successors, (139), 120 states have internal predecessors, (139), 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:42:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2022-01-31 11:42:02,681 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 71 [2022-01-31 11:42:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:42:02,681 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2022-01-31 11:42:02,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 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:42:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2022-01-31 11:42:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:42:02,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:42:02,682 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:42:02,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-01-31 11:42:02,890 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:42:02,891 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:42:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:42:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1994859396, now seen corresponding path program 23 times [2022-01-31 11:42:02,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:42:02,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128029931] [2022-01-31 11:42:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:42:02,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:42:02,903 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 11:42:02,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630607237] [2022-01-31 11:42:02,903 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:42:02,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:42:02,904 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:42:02,905 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:42:03,223 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-31 11:42:03,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:42:03,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-31 11:42:03,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:42:03,246 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:42:03,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 37 treesize of output 17 [2022-01-31 11:42:03,401 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:42:03,401 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:42:03,442 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 11:42:03,442 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:42:03,499 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:42:03,529 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:42:03,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 16 treesize of output 18 [2022-01-31 11:42:03,587 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:42:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 31 proven. 64 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-31 11:42:03,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:42:03,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2563 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 11:42:03,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2563 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 2)) is different from false [2022-01-31 11:42:03,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2563 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:42:03,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2563 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 2)) is different from false [2022-01-31 11:42:03,694 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2559 Int)) (= 2 (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_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) is different from false [2022-01-31 11:42:03,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_788 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_788)) (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2559 Int)) (= 2 (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_788) c_main_~a~0.offset) v_ArrVal_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))))) is different from false [2022-01-31 11:42:03,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2563 (Array Int Int)) (v_main_~i~0_788 Int) (v_ArrVal_2559 Int) (v_ArrVal_2558 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_788)) (= (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_2558) (+ (* 4 v_main_~i~0_788) c_main_~a~0.offset) v_ArrVal_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 2))) is different from false [2022-01-31 11:42:03,780 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_789 Int)) (or (forall ((v_ArrVal_2563 (Array Int Int)) (v_main_~i~0_788 Int) (v_ArrVal_2559 Int) (v_ArrVal_2558 Int)) (or (= 2 (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_789)) v_ArrVal_2558) (+ (* 4 v_main_~i~0_788) c_main_~a~0.offset) v_ArrVal_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) (not (<= (+ v_main_~i~0_789 1) v_main_~i~0_788)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_789)))) is different from false [2022-01-31 11:42:03,890 INFO L353 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2022-01-31 11:42:03,890 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 55 [2022-01-31 11:42:03,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:42:03,896 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:42:03,899 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:42:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 51 not checked. [2022-01-31 11:42:03,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:42:03,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128029931] [2022-01-31 11:42:03,984 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 11:42:03,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630607237] [2022-01-31 11:42:03,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630607237] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:42:03,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 11:42:03,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 29 [2022-01-31 11:42:03,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559727942] [2022-01-31 11:42:03,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 11:42:03,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-31 11:42:03,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:42:03,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-31 11:42:03,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=356, Unknown=8, NotChecked=360, Total=812 [2022-01-31 11:42:03,986 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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:42:06,114 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 3) (forall ((v_main_~i~0_789 Int)) (or (forall ((v_ArrVal_2563 (Array Int Int)) (v_main_~i~0_788 Int) (v_ArrVal_2559 Int) (v_ArrVal_2558 Int)) (or (= 2 (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_789)) v_ArrVal_2558) (+ (* 4 v_main_~i~0_788) c_main_~a~0.offset) v_ArrVal_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) (not (<= (+ v_main_~i~0_789 1) v_main_~i~0_788)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_789)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= 2 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)))) is different from false [2022-01-31 11:42:08,153 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_788 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_788)) (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2559 Int)) (= 2 (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_788) c_main_~a~0.offset) v_ArrVal_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 2) (forall ((v_main_~i~0_789 Int)) (or (forall ((v_ArrVal_2563 (Array Int Int)) (v_main_~i~0_788 Int) (v_ArrVal_2559 Int) (v_ArrVal_2558 Int)) (or (= 2 (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_789)) v_ArrVal_2558) (+ (* 4 v_main_~i~0_788) c_main_~a~0.offset) v_ArrVal_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) (not (<= (+ v_main_~i~0_789 1) v_main_~i~0_788)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_789)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 4 c_main_~i~0)) is different from false [2022-01-31 11:42:08,699 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2559 Int)) (= 2 (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_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) (<= 5 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 2) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_ArrVal_2563 (Array Int Int)) (v_main_~i~0_788 Int) (v_ArrVal_2559 Int) (v_ArrVal_2558 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_788)) (= (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_2558) (+ (* 4 v_main_~i~0_788) c_main_~a~0.offset) v_ArrVal_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 2)))) is different from false [2022-01-31 11:42:10,702 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_788 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_788)) (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2559 Int)) (= 2 (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_788) c_main_~a~0.offset) v_ArrVal_2559)) |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 2) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (forall ((v_ArrVal_2563 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2563) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 2))) is different from false [2022-01-31 11:42:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:42:10,945 INFO L93 Difference]: Finished difference Result 147 states and 168 transitions. [2022-01-31 11:42:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 11:42:10,946 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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 71 [2022-01-31 11:42:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:42:10,946 INFO L225 Difference]: With dead ends: 147 [2022-01-31 11:42:10,946 INFO L226 Difference]: Without dead ends: 147 [2022-01-31 11:42:10,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=119, Invalid=469, Unknown=12, NotChecked=660, Total=1260 [2022-01-31 11:42:10,947 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 453 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:42:10,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 322 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 453 Invalid, 0 Unknown, 453 Unchecked, 0.3s Time] [2022-01-31 11:42:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-01-31 11:42:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2022-01-31 11:42:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 135 states have internal predecessors, (155), 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:42:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2022-01-31 11:42:10,949 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 71 [2022-01-31 11:42:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:42:10,949 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2022-01-31 11:42:10,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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:42:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2022-01-31 11:42:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 11:42:10,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:42:10,950 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:42:10,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-01-31 11:42:11,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:11,159 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:42:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:42:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1794549275, now seen corresponding path program 9 times [2022-01-31 11:42:11,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:42:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845508704] [2022-01-31 11:42:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:42:11,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:42:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:42:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:42:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:42:12,477 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:42:12,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:42:12,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845508704] [2022-01-31 11:42:12,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845508704] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:42:12,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042353710] [2022-01-31 11:42:12,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:42:12,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:42:12,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:42:12,479 INFO L229 MonitoredProcess]: Starting monitored process 41 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:42:12,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-01-31 11:42:12,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 11:42:12,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:42:12,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-31 11:42:12,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:42:12,757 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:42:12,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,825 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:42:12,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,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:42:12,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,859 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:42:12,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,883 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:42:12,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,903 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:42:12,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:12,919 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:42:13,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,026 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:42:13,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,137 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:42:13,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,222 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:42:13,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,334 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:42:13,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,426 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:42:13,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,589 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:42:13,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:13,862 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:42:14,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,140 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:42:14,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-01-31 11:42:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,485 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 11:42:14,485 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 94 treesize of output 63 [2022-01-31 11:42:14,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:14,769 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:42:14,769 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:42:15,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,111 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:42:15,111 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:15,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,427 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:42:15,427 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:42:15,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:42:15,661 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 11:42:15,662 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 69 treesize of output 25 [2022-01-31 11:42:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-31 11:42:15,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:44:00,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_main_~i~0_818 Int) (v_main_~i~0_816 Int) (v_ArrVal_2663 (Array Int Int)) (v_main_~i~0_825 Int) (main_~a~0.offset Int) (v_main_~i~0_814 Int) (v_main_~i~0_822 Int) (v_main_~i~0_820 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2663))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_2663 (+ (* 4 v_main_~i~0_825) main_~a~0.offset))) (.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| (+ .cse4 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_822))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_820) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_818))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_816))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse1 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_814))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (not (= .cse4 2)) (not (= .cse5 2)) (= (* 2 ~N~0) (+ .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 .cse6)))))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 11:44:07,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_818 Int) (v_main_~i~0_816 Int) (~N~0 Int) (v_ArrVal_2663 (Array Int Int)) (v_main_~i~0_825 Int) (main_~a~0.offset Int) (v_main_~i~0_814 Int) (v_main_~i~0_822 Int) (v_main_~i~0_820 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2663))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_2663 (+ (* 4 v_main_~i~0_825) main_~a~0.offset))) (.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| (+ .cse4 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_822))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_820) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_818))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_816))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse1 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_814))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (not (= .cse4 2)) (not (= .cse5 2)) (not (< (+ c_main_~i~0 1) ~N~0)) (= (* 2 ~N~0) (+ .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 .cse6)) (< (+ c_main_~i~0 2) ~N~0))))))))))) is different from false [2022-01-31 11:44:37,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_818 Int) (v_main_~i~0_816 Int) (~N~0 Int) (v_ArrVal_2663 (Array Int Int)) (v_main_~i~0_825 Int) (main_~a~0.offset Int) (v_main_~i~0_814 Int) (v_main_~i~0_822 Int) (v_main_~i~0_820 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2663))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_2663 (+ (* 4 v_main_~i~0_825) main_~a~0.offset))) (.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| (+ .cse4 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_822))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_820) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_818))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_816))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse1 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_814))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (< (+ c_main_~i~0 3) ~N~0) (not (= 2 .cse2)) (not (= 2 .cse3)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse4 2)) (not (= .cse5 2)) (= (* 2 ~N~0) (+ .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 .cse6)))))))))))) is different from false [2022-01-31 11:45:10,745 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_818 Int) (v_main_~i~0_816 Int) (~N~0 Int) (v_ArrVal_2663 (Array Int Int)) (v_main_~i~0_825 Int) (main_~a~0.offset Int) (v_main_~i~0_814 Int) (v_main_~i~0_822 Int) (v_main_~i~0_820 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2663))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_2663 (+ (* 4 v_main_~i~0_825) main_~a~0.offset))) (.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| (+ .cse4 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_822))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_820) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_818))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_816))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse1 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_814))))) (or (not (= .cse0 2)) (< (+ c_main_~i~0 4) ~N~0) (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (not (< (+ c_main_~i~0 3) ~N~0)) (not (= .cse4 2)) (not (= .cse5 2)) (= (* 2 ~N~0) (+ .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 .cse6)))))))))))) is different from false [2022-01-31 11:45:50,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_818 Int) (v_main_~i~0_816 Int) (~N~0 Int) (v_ArrVal_2663 (Array Int Int)) (v_main_~i~0_825 Int) (main_~a~0.offset Int) (v_main_~i~0_814 Int) (v_main_~i~0_822 Int) (v_main_~i~0_820 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2663))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_2663 (+ (* 4 v_main_~i~0_825) main_~a~0.offset))) (.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| (+ .cse4 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_822))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_820) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_818))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_816))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse1 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_814))))) (or (not (= .cse0 2)) (< (+ c_main_~i~0 5) ~N~0) (not (= .cse1 2)) (not (= 2 .cse2)) (not (= 2 .cse3)) (not (= .cse4 2)) (not (= .cse5 2)) (not (< (+ c_main_~i~0 4) ~N~0)) (= (* 2 ~N~0) (+ .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 .cse6)))))))))))) is different from false [2022-01-31 11:46:39,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_818 Int) (v_main_~i~0_816 Int) (~N~0 Int) (v_ArrVal_2663 (Array Int Int)) (v_main_~i~0_825 Int) (main_~a~0.offset Int) (v_main_~i~0_814 Int) (v_main_~i~0_822 Int) (v_main_~i~0_820 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2663))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_2663 (+ (* 4 v_main_~i~0_825) main_~a~0.offset))) (.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| (+ .cse4 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_822))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_820) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_818))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_816))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse1 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_814))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (< (+ c_main_~i~0 6) ~N~0) (not (= 2 .cse2)) (not (= 2 .cse3)) (not (= .cse4 2)) (not (= .cse5 2)) (not (< (+ c_main_~i~0 5) ~N~0)) (= (* 2 ~N~0) (+ .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 .cse6)))))))))))) is different from false [2022-01-31 11:47:33,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_818 Int) (v_main_~i~0_816 Int) (~N~0 Int) (v_ArrVal_2663 (Array Int Int)) (v_main_~i~0_825 Int) (main_~a~0.offset Int) (v_main_~i~0_814 Int) (v_main_~i~0_822 Int) (v_main_~i~0_820 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2663))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse4 (select v_ArrVal_2663 (+ (* 4 v_main_~i~0_825) main_~a~0.offset))) (.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| (+ .cse4 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_822))))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_820) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_818))))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_816))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse0 .cse4 .cse1 .cse5 .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_814))))) (or (not (= .cse0 2)) (not (= .cse1 2)) (not (< 5 ~N~0)) (not (= 2 .cse2)) (not (= 2 .cse3)) (not (= .cse4 2)) (not (= .cse5 2)) (< 6 ~N~0) (= (* 2 ~N~0) (+ .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 .cse6)))))))))))) is different from false