/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/ssina.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 12:01:25,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:01:25,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:01:26,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:01:26,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:01:26,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:01:26,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:01:26,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:01:26,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:01:26,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:01:26,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:01:26,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:01:26,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:01:26,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:01:26,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:01:26,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:01:26,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:01:26,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:01:26,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:01:26,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:01:26,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:01:26,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:01:26,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:01:26,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:01:26,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:01:26,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:01:26,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:01:26,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:01:26,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:01:26,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:01:26,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:01:26,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:01:26,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:01:26,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:01:26,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:01:26,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:01:26,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:01:26,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:01:26,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:01:26,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:01:26,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:01:26,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:01:26,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:01:26,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:01:26,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:01:26,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:01:26,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:01:26,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:01:26,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:01:26,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:01:26,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:01:26,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:01:26,095 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:01:26,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:01:26,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:01:26,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:01:26,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:01:26,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:01:26,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:01:26,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:01:26,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:01:26,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:01:26,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:01:26,097 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:01:26,097 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 12:01:26,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:01:26,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:01:26,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:01:26,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:01:26,317 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:01:26,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ssina.c [2022-01-31 12:01:26,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbb3c6e7/79a69abe7e554e91804f444da89beaf8/FLAGbb5d31b32 [2022-01-31 12:01:26,762 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:01:26,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ssina.c [2022-01-31 12:01:26,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbb3c6e7/79a69abe7e554e91804f444da89beaf8/FLAGbb5d31b32 [2022-01-31 12:01:27,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cbb3c6e7/79a69abe7e554e91804f444da89beaf8 [2022-01-31 12:01:27,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:01:27,180 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:01:27,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:01:27,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:01:27,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:01:27,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1349dbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27, skipping insertion in model container [2022-01-31 12:01:27,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:01:27,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:01:27,333 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/ssina.c[588,601] [2022-01-31 12:01:27,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:01:27,370 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:01:27,380 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/ssina.c[588,601] [2022-01-31 12:01:27,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:01:27,416 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:01:27,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27 WrapperNode [2022-01-31 12:01:27,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:01:27,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:01:27,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:01:27,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:01:27,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:01:27,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:01:27,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:01:27,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:01:27,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:01:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:01:27,517 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 12:01:27,539 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 12:01:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:01:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:01:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:01:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 12:01:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:01:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:01:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:01:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:01:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:01:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:01:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 12:01:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:01:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 12:01:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 12:01:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:01:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 12:01:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 12:01:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:01:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:01:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:01:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:01:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:01:27,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:01:27,635 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:01:27,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:01:27,832 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:01:27,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:01:27,838 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-31 12:01:27,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:01:27 BoogieIcfgContainer [2022-01-31 12:01:27,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:01:27,841 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:01:27,841 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:01:27,843 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:01:27,845 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:01:27" (1/1) ... [2022-01-31 12:01:27,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:01:27 BasicIcfg [2022-01-31 12:01:27,862 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:01:27,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:01:27,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:01:27,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:01:27,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:01:27" (1/4) ... [2022-01-31 12:01:27,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf10619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:01:27, skipping insertion in model container [2022-01-31 12:01:27,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:01:27" (2/4) ... [2022-01-31 12:01:27,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf10619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:01:27, skipping insertion in model container [2022-01-31 12:01:27,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:01:27" (3/4) ... [2022-01-31 12:01:27,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf10619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:01:27, skipping insertion in model container [2022-01-31 12:01:27,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:01:27" (4/4) ... [2022-01-31 12:01:27,869 INFO L111 eAbstractionObserver]: Analyzing ICFG ssina.cJordan [2022-01-31 12:01:27,874 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:01:27,875 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:01:27,916 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:01:27,929 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 12:01:27,929 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:01:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 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 12:01:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 12:01:27,963 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:01:27,963 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] [2022-01-31 12:01:27,964 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:01:27,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:01:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1605646092, now seen corresponding path program 1 times [2022-01-31 12:01:27,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:01:27,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104109115] [2022-01-31 12:01:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:01:27,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:01:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:28,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:01:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:28,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:01:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:28,226 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 12:01:28,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:01:28,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104109115] [2022-01-31 12:01:28,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104109115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:01:28,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:01:28,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:01:28,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697205780] [2022-01-31 12:01:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:01:28,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:01:28,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:01:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:01:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:01:28,268 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 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 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 12:01:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:01:28,330 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-01-31 12:01:28,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:01:28,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 28 [2022-01-31 12:01:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:01:28,340 INFO L225 Difference]: With dead ends: 43 [2022-01-31 12:01:28,341 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 12:01:28,342 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 12:01:28,346 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:01:28,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:01:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 12:01:28,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-31 12:01:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:01:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-01-31 12:01:28,386 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 28 [2022-01-31 12:01:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:01:28,387 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-01-31 12:01:28,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 12:01:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-01-31 12:01:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 12:01:28,388 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:01:28,388 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] [2022-01-31 12:01:28,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:01:28,389 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:01:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:01:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1186567865, now seen corresponding path program 1 times [2022-01-31 12:01:28,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:01:28,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669219517] [2022-01-31 12:01:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:01:28,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:01:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:01:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:28,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 12:01:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:28,550 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 12:01:28,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:01:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669219517] [2022-01-31 12:01:28,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669219517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:01:28,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:01:28,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 12:01:28,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989993236] [2022-01-31 12:01:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:01:28,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 12:01:28,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:01:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 12:01:28,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 12:01:28,556 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 12:01:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:01:28,708 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-01-31 12:01:28,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 12:01:28,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 28 [2022-01-31 12:01:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:01:28,714 INFO L225 Difference]: With dead ends: 52 [2022-01-31 12:01:28,715 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 12:01:28,720 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 12:01:28,722 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:01:28,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 34 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 12:01:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 12:01:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-01-31 12:01:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:01:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-01-31 12:01:28,745 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 28 [2022-01-31 12:01:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:01:28,745 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-01-31 12:01:28,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 12:01:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-01-31 12:01:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 12:01:28,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:01:28,746 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:01:28,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 12:01:28,747 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:01:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:01:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash 147811565, now seen corresponding path program 1 times [2022-01-31 12:01:28,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:01:28,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996996938] [2022-01-31 12:01:28,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:01:28,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:01:28,795 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:01:28,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601425444] [2022-01-31 12:01:28,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:01:28,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:01:28,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:01:28,800 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 12:01:28,811 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 12:01:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:01:28,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-31 12:01:28,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:01:29,021 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 12:01:29,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 12:01:29,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 12:01:29,294 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 36 treesize of output 23 [2022-01-31 12:01:29,422 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 40 treesize of output 23 [2022-01-31 12:01:29,572 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 32 treesize of output 23 [2022-01-31 12:01:29,629 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 36 treesize of output 23 [2022-01-31 12:01:29,779 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 38 treesize of output 25 [2022-01-31 12:01:29,979 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 32 treesize of output 16 [2022-01-31 12:01:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:01:30,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:01:33,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:01:33,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:01:33,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996996938] [2022-01-31 12:01:33,581 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:01:33,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601425444] [2022-01-31 12:01:33,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601425444] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:01:33,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:01:33,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2022-01-31 12:01:33,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038075545] [2022-01-31 12:01:33,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:01:33,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-31 12:01:33,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:01:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-31 12:01:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=977, Unknown=1, NotChecked=0, Total=1122 [2022-01-31 12:01:33,588 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 34 states, 32 states have (on average 1.8125) internal successors, (58), 33 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:01:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:01:40,512 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-01-31 12:01:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-31 12:01:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.8125) internal successors, (58), 33 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2022-01-31 12:01:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:01:40,514 INFO L225 Difference]: With dead ends: 82 [2022-01-31 12:01:40,514 INFO L226 Difference]: Without dead ends: 82 [2022-01-31 12:01:40,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=285, Invalid=1970, Unknown=1, NotChecked=0, Total=2256 [2022-01-31 12:01:40,516 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 77 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-31 12:01:40,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 321 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 667 Invalid, 0 Unknown, 13 Unchecked, 2.7s Time] [2022-01-31 12:01:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-31 12:01:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2022-01-31 12:01:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 12:01:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-01-31 12:01:40,523 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 38 [2022-01-31 12:01:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:01:40,524 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-01-31 12:01:40,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.8125) internal successors, (58), 33 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:01:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-01-31 12:01:40,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 12:01:40,525 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:01:40,525 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, 1, 1, 1, 1, 1, 1] [2022-01-31 12:01:40,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 12:01:40,743 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 12:01:40,744 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:01:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:01:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2045725077, now seen corresponding path program 2 times [2022-01-31 12:01:40,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:01:40,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508900804] [2022-01-31 12:01:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:01:40,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:01:40,767 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:01:40,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768086668] [2022-01-31 12:01:40,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:01:40,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:01:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:01:40,769 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 12:01:40,774 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 12:01:40,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:01:40,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:01:40,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:01:40,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:01:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 12:01:40,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:01:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 12:01:41,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:01:41,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508900804] [2022-01-31 12:01:41,016 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:01:41,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768086668] [2022-01-31 12:01:41,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768086668] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:01:41,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:01:41,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 12:01:41,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747271723] [2022-01-31 12:01:41,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:01:41,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 12:01:41,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:01:41,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 12:01:41,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 12:01:41,018 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 12:01:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:01:41,231 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2022-01-31 12:01:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 12:01:41,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 40 [2022-01-31 12:01:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:01:41,233 INFO L225 Difference]: With dead ends: 91 [2022-01-31 12:01:41,233 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 12:01:41,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-01-31 12:01:41,234 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 52 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:01:41,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 124 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 12:01:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 12:01:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2022-01-31 12:01:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 67 states have internal predecessors, (77), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 12:01:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-01-31 12:01:41,242 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 40 [2022-01-31 12:01:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:01:41,243 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-01-31 12:01:41,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 12:01:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-01-31 12:01:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 12:01:41,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:01:41,244 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, 1, 1, 1, 1, 1, 1] [2022-01-31 12:01:41,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 12:01:41,447 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 12:01:41,448 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:01:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:01:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash -957292085, now seen corresponding path program 3 times [2022-01-31 12:01:41,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:01:41,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898982850] [2022-01-31 12:01:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:01:41,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:01:41,469 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:01:41,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999946264] [2022-01-31 12:01:41,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 12:01:41,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:01:41,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:01:41,472 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 12:01:41,473 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 12:01:41,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 12:01:41,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:01:41,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:01:41,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:01:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 12:01:41,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:01:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 12:01:41,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:01:41,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898982850] [2022-01-31 12:01:41,743 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:01:41,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999946264] [2022-01-31 12:01:41,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999946264] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:01:41,743 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:01:41,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 12:01:41,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159121658] [2022-01-31 12:01:41,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:01:41,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 12:01:41,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:01:41,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 12:01:41,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 12:01:41,745 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 12:01:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:01:41,914 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-01-31 12:01:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:01:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 40 [2022-01-31 12:01:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:01:41,916 INFO L225 Difference]: With dead ends: 92 [2022-01-31 12:01:41,916 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 12:01:41,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:01:41,917 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:01:41,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 113 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 12:01:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 12:01:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2022-01-31 12:01:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:01:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-01-31 12:01:41,922 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 40 [2022-01-31 12:01:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:01:41,923 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-01-31 12:01:41,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 12:01:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-01-31 12:01:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 12:01:41,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:01:41,924 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2022-01-31 12:01:41,955 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 12:01:42,124 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 12:01:42,125 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:01:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:01:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 201880609, now seen corresponding path program 4 times [2022-01-31 12:01:42,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:01:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815795287] [2022-01-31 12:01:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:01:42,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:01:42,147 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:01:42,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45742925] [2022-01-31 12:01:42,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 12:01:42,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:01:42,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:01:42,149 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 12:01:42,162 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 12:01:42,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 12:01:42,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:01:42,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 79 conjunts are in the unsatisfiable core [2022-01-31 12:01:42,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:01:42,276 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 12:01:42,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 12:01:42,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 12:01:42,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:42,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 12:01:42,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-01-31 12:01:42,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:42,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-01-31 12:01:42,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:42,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2022-01-31 12:01:43,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 12:01:43,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:43,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-01-31 12:01:43,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2022-01-31 12:01:43,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:01:43,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 12:01:43,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,514 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 12:01:43,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 50 [2022-01-31 12:01:43,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:01:43,699 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 22 treesize of output 10 [2022-01-31 12:01:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:01:43,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:01:46,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_73 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_73)) (forall ((v_ArrVal_236 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_73 8)) v_ArrVal_236) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))) is different from false [2022-01-31 12:01:46,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 Int) (v_main_~i~0_73 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_73)) (= (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1) (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (store .cse0 .cse1 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* v_main_~i~0_73 8)) v_ArrVal_236) c_main_~a~0.offset)))) is different from false [2022-01-31 12:02:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-31 12:02:17,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:02:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815795287] [2022-01-31 12:02:17,611 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:02:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45742925] [2022-01-31 12:02:17,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45742925] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:02:17,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:02:17,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 52 [2022-01-31 12:02:17,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667844663] [2022-01-31 12:02:17,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:02:17,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-31 12:02:17,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:02:17,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-31 12:02:17,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2264, Unknown=3, NotChecked=194, Total=2652 [2022-01-31 12:02:17,614 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 3 states have call successors, (5), 2 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 12:02:23,609 WARN L228 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 65 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:02:29,517 WARN L228 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 65 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:02:31,599 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_~N~0 2) (= c_main_~i~0 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 6) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (= (select .cse0 (+ c_main_~a~0.offset (* c_main_~i~0 8))) 9) (= (select .cse0 (+ c_main_~a~0.offset 8)) 3) (forall ((v_main_~i~0_73 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_73)) (forall ((v_ArrVal_236 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_73 8)) v_ArrVal_236) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))))) is different from false [2022-01-31 12:03:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:03:10,460 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-01-31 12:03:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-31 12:03:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-01-31 12:03:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:03:10,462 INFO L225 Difference]: With dead ends: 105 [2022-01-31 12:03:10,462 INFO L226 Difference]: Without dead ends: 105 [2022-01-31 12:03:10,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 83.7s TimeCoverageRelationStatistics Valid=211, Invalid=2647, Unknown=16, NotChecked=318, Total=3192 [2022-01-31 12:03:10,465 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 660 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:03:10,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 553 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 660 Unchecked, 0.2s Time] [2022-01-31 12:03:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-31 12:03:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2022-01-31 12:03:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 79 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 12:03:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-01-31 12:03:10,472 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 48 [2022-01-31 12:03:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:03:10,472 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-01-31 12:03:10,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 3 states have call successors, (5), 2 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 12:03:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-01-31 12:03:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 12:03:10,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:03:10,473 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2022-01-31 12:03:10,503 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 12:03:10,674 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 12:03:10,674 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:03:10,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:03:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1451366559, now seen corresponding path program 5 times [2022-01-31 12:03:10,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:03:10,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23842370] [2022-01-31 12:03:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:03:10,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:03:10,702 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:03:10,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143892194] [2022-01-31 12:03:10,702 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 12:03:10,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:03:10,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:03:10,704 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 12:03:10,713 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 12:03:10,817 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 12:03:10,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:03:10,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 12:03:10,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:03:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 12:03:10,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:03:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 12:03:11,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:03:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23842370] [2022-01-31 12:03:11,031 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:03:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143892194] [2022-01-31 12:03:11,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143892194] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:03:11,031 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:03:11,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 12:03:11,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047524781] [2022-01-31 12:03:11,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:03:11,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 12:03:11,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:03:11,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 12:03:11,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:03:11,033 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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 12:03:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:03:11,240 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2022-01-31 12:03:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 12:03:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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 50 [2022-01-31 12:03:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:03:11,242 INFO L225 Difference]: With dead ends: 148 [2022-01-31 12:03:11,242 INFO L226 Difference]: Without dead ends: 145 [2022-01-31 12:03:11,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 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 12:03:11,243 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 126 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:03:11,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 126 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 12:03:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-31 12:03:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2022-01-31 12:03:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 110 states have (on average 1.1090909090909091) internal successors, (122), 112 states have internal predecessors, (122), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 12:03:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-01-31 12:03:11,253 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 50 [2022-01-31 12:03:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:03:11,253 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-01-31 12:03:11,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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 12:03:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-01-31 12:03:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 12:03:11,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:03:11,254 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2022-01-31 12:03:11,278 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 12:03:11,467 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 12:03:11,468 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:03:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:03:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1551026717, now seen corresponding path program 6 times [2022-01-31 12:03:11,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:03:11,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045025346] [2022-01-31 12:03:11,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:03:11,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:03:11,486 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:03:11,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040583415] [2022-01-31 12:03:11,487 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 12:03:11,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:03:11,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:03:11,488 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 12:03:11,490 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 12:03:11,569 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 12:03:11,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:03:11,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 12:03:11,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:03:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 12:03:11,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:03:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 12:03:11,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:03:11,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045025346] [2022-01-31 12:03:11,789 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:03:11,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040583415] [2022-01-31 12:03:11,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040583415] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:03:11,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:03:11,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 12:03:11,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974082034] [2022-01-31 12:03:11,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:03:11,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 12:03:11,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:03:11,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 12:03:11,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:03:11,791 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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 12:03:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:03:12,120 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-01-31 12:03:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:03:12,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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 50 [2022-01-31 12:03:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:03:12,121 INFO L225 Difference]: With dead ends: 120 [2022-01-31 12:03:12,122 INFO L226 Difference]: Without dead ends: 118 [2022-01-31 12:03:12,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 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 12:03:12,122 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 78 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 12:03:12,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 233 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 12:03:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-31 12:03:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-01-31 12:03:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.0786516853932584) internal successors, (96), 89 states have internal predecessors, (96), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 12:03:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-01-31 12:03:12,136 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 50 [2022-01-31 12:03:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:03:12,137 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-01-31 12:03:12,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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 12:03:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-01-31 12:03:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 12:03:12,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:03:12,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:03:12,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-31 12:03:12,343 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 12:03:12,343 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:03:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:03:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1572069590, now seen corresponding path program 1 times [2022-01-31 12:03:12,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:03:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933618105] [2022-01-31 12:03:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:03:12,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:03:12,359 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:03:12,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337194559] [2022-01-31 12:03:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:03:12,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:03:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:03:12,361 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 12:03:12,383 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 12:03:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:03:12,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-31 12:03:12,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:03:12,474 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 12:03:12,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 12:03:12,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:12,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-31 12:03:12,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 23 treesize of output 23 [2022-01-31 12:03:12,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:12,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 12:03:12,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:12,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:12,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-01-31 12:03:12,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:12,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2022-01-31 12:03:12,784 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 38 treesize of output 34 [2022-01-31 12:03:12,788 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 9 [2022-01-31 12:03:12,816 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 25 [2022-01-31 12:03:12,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:12,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-01-31 12:03:12,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:12,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:12,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2022-01-31 12:03:12,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:12,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-01-31 12:03:13,204 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 12:03:13,204 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 1 case distinctions, treesize of input 33 treesize of output 17 [2022-01-31 12:03:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:03:13,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:03:13,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:03:13,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933618105] [2022-01-31 12:03:13,430 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:03:13,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337194559] [2022-01-31 12:03:13,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337194559] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:03:13,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:03:13,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2022-01-31 12:03:13,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322223869] [2022-01-31 12:03:13,430 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 12:03:13,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 12:03:13,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:03:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 12:03:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2022-01-31 12:03:13,432 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 12:03:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:03:13,832 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-01-31 12:03:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 12:03:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-01-31 12:03:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:03:13,834 INFO L225 Difference]: With dead ends: 100 [2022-01-31 12:03:13,834 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 12:03:13,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2022-01-31 12:03:13,835 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 12:03:13,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 312 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 443 Invalid, 0 Unknown, 53 Unchecked, 0.3s Time] [2022-01-31 12:03:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 12:03:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-01-31 12:03:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:03:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-01-31 12:03:13,838 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 56 [2022-01-31 12:03:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:03:13,838 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-01-31 12:03:13,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 12:03:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-01-31 12:03:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 12:03:13,839 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:03:13,840 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2022-01-31 12:03:13,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-31 12:03:14,059 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 12:03:14,060 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:03:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:03:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2035454891, now seen corresponding path program 7 times [2022-01-31 12:03:14,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:03:14,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112628543] [2022-01-31 12:03:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:03:14,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:03:14,081 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:03:14,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [884932153] [2022-01-31 12:03:14,082 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 12:03:14,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:03:14,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:03:14,083 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 12:03:14,087 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 12:03:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:03:14,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 111 conjunts are in the unsatisfiable core [2022-01-31 12:03:14,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:03:14,215 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 12:03:14,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 12:03:14,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 12:03:14,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 12:03:14,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-01-31 12:03:14,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:14,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-01-31 12:03:14,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:14,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2022-01-31 12:03:14,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 54 [2022-01-31 12:03:14,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:14,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:14,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 61 [2022-01-31 12:03:15,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:15,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 72 [2022-01-31 12:03:15,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-01-31 12:03:15,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2022-01-31 12:03:15,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:15,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-01-31 12:03:15,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:15,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-01-31 12:03:15,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2022-01-31 12:03:15,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:15,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2022-01-31 12:03:15,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:15,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:03:15,889 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2022-01-31 12:03:16,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:16,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:03:16,045 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 12:03:16,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 52 [2022-01-31 12:03:16,202 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 22 treesize of output 10 [2022-01-31 12:03:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:03:16,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:03:18,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_149 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_149)) (forall ((v_ArrVal_553 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_149) c_main_~a~0.offset) v_ArrVal_553) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))) is different from false [2022-01-31 12:07:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 12:07:53,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:07:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112628543] [2022-01-31 12:07:53,117 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:07:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884932153] [2022-01-31 12:07:53,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884932153] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:07:53,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:07:53,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 72 [2022-01-31 12:07:53,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104794892] [2022-01-31 12:07:53,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:07:53,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-01-31 12:07:53,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:07:53,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-01-31 12:07:53,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4585, Unknown=97, NotChecked=138, Total=5112 [2022-01-31 12:07:53,120 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 72 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 71 states have internal predecessors, (94), 3 states have call successors, (5), 2 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 12:08:26,686 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_149 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_149)) (forall ((v_ArrVal_553 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_149) c_main_~a~0.offset) v_ArrVal_553) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))) (< 2 c_~N~0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (+ .cse0 4)) (= .cse0 12)))) (= c_main_~a~0.offset 0) (= 4 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 16))) (<= c_~N~0 3) (= c_main_~i~0 1)) is different from false [2022-01-31 12:08:28,690 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 12))) (forall ((v_main_~i~0_149 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_149)) (forall ((v_ArrVal_553 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_149) c_main_~a~0.offset) v_ArrVal_553) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))) (< 2 c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 16) (= c_main_~a~0.offset 0) (<= c_~N~0 3) (forall ((v_ArrVal_553 Int) (v_ArrVal_551 Int) (v_main_~i~0_149 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_149)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) v_ArrVal_551) (+ (* 8 v_main_~i~0_149) c_main_~a~0.offset) v_ArrVal_553) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))) is different from false [2022-01-31 12:08:30,695 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_149 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_149)) (forall ((v_ArrVal_553 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_149) c_main_~a~0.offset) v_ArrVal_553) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))) (forall ((v_ArrVal_553 Int) (v_ArrVal_551 Int) (v_main_~i~0_149 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_149)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) v_ArrVal_551) (+ (* 8 v_main_~i~0_149) c_main_~a~0.offset) v_ArrVal_553) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))) is different from false [2022-01-31 12:08:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:08:32,551 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-01-31 12:08:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-31 12:08:32,551 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 71 states have internal predecessors, (94), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2022-01-31 12:08:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:08:32,552 INFO L225 Difference]: With dead ends: 129 [2022-01-31 12:08:32,552 INFO L226 Difference]: Without dead ends: 129 [2022-01-31 12:08:32,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 302.1s TimeCoverageRelationStatistics Valid=353, Invalid=5724, Unknown=101, NotChecked=628, Total=6806 [2022-01-31 12:08:32,554 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1061 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:08:32,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 703 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 1061 Unchecked, 0.2s Time] [2022-01-31 12:08:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-01-31 12:08:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2022-01-31 12:08:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 99 states have internal predecessors, (111), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 12:08:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-01-31 12:08:32,559 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 58 [2022-01-31 12:08:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:08:32,559 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-01-31 12:08:32,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 71 states have internal predecessors, (94), 3 states have call successors, (5), 2 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 12:08:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-01-31 12:08:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 12:08:32,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:08:32,561 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2022-01-31 12:08:32,580 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 12:08:32,761 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 12:08:32,761 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:08:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:08:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 288435155, now seen corresponding path program 8 times [2022-01-31 12:08:32,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:08:32,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057257183] [2022-01-31 12:08:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:08:32,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:08:32,795 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:08:32,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471772769] [2022-01-31 12:08:32,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:08:32,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:08:32,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:08:32,802 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 12:08:32,803 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 12:08:32,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:08:32,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:08:32,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 12:08:32,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:08:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 12:08:33,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:08:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 12:08:33,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:08:33,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057257183] [2022-01-31 12:08:33,154 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:08:33,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471772769] [2022-01-31 12:08:33,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471772769] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:08:33,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:08:33,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 12:08:33,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000001135] [2022-01-31 12:08:33,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:08:33,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 12:08:33,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:08:33,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 12:08:33,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:08:33,156 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 12:08:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:08:33,455 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2022-01-31 12:08:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:08:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 12:08:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:08:33,457 INFO L225 Difference]: With dead ends: 180 [2022-01-31 12:08:33,457 INFO L226 Difference]: Without dead ends: 177 [2022-01-31 12:08:33,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 106 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 12:08:33,458 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 162 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:08:33,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 124 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 12:08:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-31 12:08:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2022-01-31 12:08:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 139 states have internal predecessors, (149), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 12:08:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2022-01-31 12:08:33,463 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 60 [2022-01-31 12:08:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:08:33,464 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-01-31 12:08:33,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 12:08:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2022-01-31 12:08:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 12:08:33,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:08:33,465 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2022-01-31 12:08:33,486 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 12:08:33,679 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 12:08:33,679 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:08:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:08:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1527871313, now seen corresponding path program 9 times [2022-01-31 12:08:33,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:08:33,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605293662] [2022-01-31 12:08:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:08:33,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:08:33,709 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:08:33,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171476550] [2022-01-31 12:08:33,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 12:08:33,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:08:33,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:08:33,710 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 12:08:33,712 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 12:08:33,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 12:08:33,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:08:33,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 12:08:33,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:08:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 12:08:34,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:08:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-31 12:08:34,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:08:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605293662] [2022-01-31 12:08:34,281 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:08:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171476550] [2022-01-31 12:08:34,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171476550] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:08:34,282 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:08:34,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 12:08:34,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678779400] [2022-01-31 12:08:34,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:08:34,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 12:08:34,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:08:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 12:08:34,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:08:34,283 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 12:08:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:08:34,774 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-01-31 12:08:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 12:08:34,774 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 12:08:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:08:34,775 INFO L225 Difference]: With dead ends: 146 [2022-01-31 12:08:34,775 INFO L226 Difference]: Without dead ends: 146 [2022-01-31 12:08:34,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-01-31 12:08:34,776 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 90 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 12:08:34,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 221 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 12:08:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-31 12:08:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2022-01-31 12:08:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.072072072072072) internal successors, (119), 112 states have internal predecessors, (119), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 12:08:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2022-01-31 12:08:34,780 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 60 [2022-01-31 12:08:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:08:34,780 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2022-01-31 12:08:34,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 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 12:08:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2022-01-31 12:08:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 12:08:34,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:08:34,781 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:08:34,802 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 12:08:34,987 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 12:08:34,987 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:08:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:08:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1573348618, now seen corresponding path program 2 times [2022-01-31 12:08:34,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:08:34,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646918691] [2022-01-31 12:08:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:08:34,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:08:35,002 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:08:35,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662145440] [2022-01-31 12:08:35,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:08:35,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:08:35,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:08:35,004 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 12:08:35,031 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 12:08:35,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:08:35,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:08:35,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-31 12:08:35,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:08:35,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 12:08:35,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,186 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 28 treesize of output 27 [2022-01-31 12:08:35,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 12:08:35,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 12:08:35,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 12:08:35,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 12:08:35,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:35,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-01-31 12:08:35,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:35,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2022-01-31 12:08:35,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2022-01-31 12:08:35,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,709 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 35 treesize of output 31 [2022-01-31 12:08:35,712 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 25 treesize of output 21 [2022-01-31 12:08:35,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,745 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 20 [2022-01-31 12:08:35,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,765 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 20 [2022-01-31 12:08:35,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-01-31 12:08:35,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:35,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-01-31 12:08:35,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:35,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-31 12:08:35,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:35,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:36,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:36,002 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 12:08:36,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-01-31 12:08:36,330 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 12:08:36,330 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 1 case distinctions, treesize of input 33 treesize of output 17 [2022-01-31 12:08:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 12:08:36,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:08:36,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:08:36,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646918691] [2022-01-31 12:08:36,596 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:08:36,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662145440] [2022-01-31 12:08:36,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662145440] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:08:36,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:08:36,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2022-01-31 12:08:36,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086585093] [2022-01-31 12:08:36,596 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 12:08:36,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-31 12:08:36,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:08:36,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-31 12:08:36,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 12:08:36,598 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 12:08:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:08:37,318 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2022-01-31 12:08:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 12:08:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-01-31 12:08:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:08:37,320 INFO L225 Difference]: With dead ends: 144 [2022-01-31 12:08:37,320 INFO L226 Difference]: Without dead ends: 142 [2022-01-31 12:08:37,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=1379, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 12:08:37,321 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 12:08:37,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 304 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 719 Invalid, 0 Unknown, 108 Unchecked, 0.5s Time] [2022-01-31 12:08:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-01-31 12:08:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2022-01-31 12:08:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.065040650406504) internal successors, (131), 124 states have internal predecessors, (131), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 12:08:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2022-01-31 12:08:37,325 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 66 [2022-01-31 12:08:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:08:37,326 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2022-01-31 12:08:37,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 12:08:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2022-01-31 12:08:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 12:08:37,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:08:37,327 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2022-01-31 12:08:37,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-31 12:08:37,535 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 12:08:37,536 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:08:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:08:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2145970807, now seen corresponding path program 10 times [2022-01-31 12:08:37,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:08:37,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988800270] [2022-01-31 12:08:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:08:37,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:08:37,566 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 12:08:37,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316595907] [2022-01-31 12:08:37,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 12:08:37,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:08:37,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:08:37,568 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 12:08:37,570 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 12:08:37,676 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 12:08:37,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:08:37,679 WARN L261 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 135 conjunts are in the unsatisfiable core [2022-01-31 12:08:37,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:08:37,710 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 12:08:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 12:08:37,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 12:08:37,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-01-31 12:08:37,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:37,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-01-31 12:08:38,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:38,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-01-31 12:08:38,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:38,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2022-01-31 12:08:38,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:38,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2022-01-31 12:08:38,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:38,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 66 [2022-01-31 12:08:38,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:38,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2022-01-31 12:08:38,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:38,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:38,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 68 [2022-01-31 12:08:39,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:39,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2022-01-31 12:08:39,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2022-01-31 12:08:39,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-01-31 12:08:39,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:39,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-01-31 12:08:39,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:39,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,768 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2022-01-31 12:08:39,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:39,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:39,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2022-01-31 12:08:40,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-01-31 12:08:40,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:40,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-01-31 12:08:40,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:08:40,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2022-01-31 12:08:40,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:40,857 INFO L353 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2022-01-31 12:08:40,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 68 [2022-01-31 12:08:41,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:41,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:41,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:41,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:41,125 INFO L353 Elim1Store]: treesize reduction 78, result has 29.1 percent of original size [2022-01-31 12:08:41,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2022-01-31 12:08:41,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 12:08:41,349 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 22 treesize of output 10 [2022-01-31 12:08:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:08:41,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:08:43,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_250 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_250)) (forall ((v_ArrVal_964 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1))))) is different from false [2022-01-31 12:09:22,945 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_251 Int)) (or (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_ArrVal_964 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_251)))) is different from false [2022-01-31 12:09:24,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_251)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_959) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)))) is different from false [2022-01-31 12:09:27,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)) (not (<= (+ c_main_~i~0 2) v_main_~i~0_251)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) v_ArrVal_959) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)))) is different from false [2022-01-31 12:09:29,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)) (not (<= (+ c_main_~i~0 2) v_main_~i~0_251)) (= (select (store (store (let ((.cse2 (* c_main_~i~0 8))) (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ c_main_~a~0.offset .cse2))) (store .cse0 .cse1 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse0 .cse1)))) (+ c_main_~a~0.offset .cse2 8) v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)))) is different from false [2022-01-31 12:15:13,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:15:13,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 12:15:13,094 INFO L353 Elim1Store]: treesize reduction 730, result has 0.1 percent of original size [2022-01-31 12:15:13,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 4952 treesize of output 1 [2022-01-31 12:15:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 64 refuted. 3 times theorem prover too weak. 0 trivial. 13 not checked. [2022-01-31 12:15:13,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:15:13,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988800270] [2022-01-31 12:15:13,116 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 12:15:13,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316595907] [2022-01-31 12:15:13,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316595907] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:15:13,116 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 12:15:13,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48] total 93 [2022-01-31 12:15:13,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520011136] [2022-01-31 12:15:13,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 12:15:13,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-01-31 12:15:13,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:15:13,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-01-31 12:15:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=6993, Unknown=91, NotChecked=880, Total=8556 [2022-01-31 12:15:13,120 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 93 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 92 states have internal predecessors, (118), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 12:15:15,386 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (< 4 c_~N~0))) (and (or .cse0 (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse10 (+ c_main_~a~0.offset 8))) (store (let ((.cse8 (+ c_main_~a~0.offset 24)) (.cse9 (+ c_main_~a~0.offset 16))) (let ((.cse6 (let ((.cse21 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse16 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (.cse18 (select .cse21 |c_main_~#sum~0.offset|))) (let ((.cse20 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse18))) c_main_~a~0.base) .cse10))) (let ((.cse17 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse18 .cse20))) c_main_~a~0.base) .cse9))) (let ((.cse19 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse20))) c_main_~a~0.base) .cse8))) (let ((.cse11 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20))))) (store .cse11 c_main_~a~0.base (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (select .cse11 c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ .cse16 .cse17 (select .cse15 c_main_~a~0.offset) .cse18 .cse19 .cse20))))) (store .cse14 .cse10 (+ (select (select (store .cse11 c_main_~a~0.base .cse14) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse14 .cse10)))))) (store .cse13 .cse9 (+ (select (select (store .cse11 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse13 .cse9)))))) (store .cse12 .cse8 (+ (select .cse12 .cse8) (select (select (store .cse11 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| .cse5)) c_main_~a~0.base) .cse10))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) .cse9))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse5))) c_main_~a~0.base) .cse8))) (let ((.cse1 (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse5))) c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (+ .cse2 .cse3 .cse4 (select .cse1 c_main_~a~0.offset) .cse5)))))))))) .cse10 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250))))) (or (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse31 (+ c_main_~a~0.offset 8))) (store (let ((.cse29 (+ c_main_~a~0.offset 24)) (.cse30 (+ c_main_~a~0.offset 16))) (let ((.cse27 (let ((.cse44 (let ((.cse45 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse45 8) 1) (+ c_main_~a~0.offset 16 .cse45) 1)))) (let ((.cse42 (store |c_#memory_int| c_main_~a~0.base .cse44))) (let ((.cse43 (select .cse42 |c_main_~#sum~0.base|))) (let ((.cse38 (select .cse44 c_main_~a~0.offset)) (.cse40 (select .cse43 |c_main_~#sum~0.offset|))) (let ((.cse41 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse38 .cse40))) c_main_~a~0.base) .cse31))) (let ((.cse37 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse38 .cse40 .cse41))) c_main_~a~0.base) .cse30))) (let ((.cse39 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse37 .cse38 .cse40 .cse41))) c_main_~a~0.base) .cse29))) (let ((.cse32 (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse37 .cse38 .cse39 .cse40 .cse41))))) (store .cse32 c_main_~a~0.base (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (select .cse32 c_main_~a~0.base))) (store .cse36 c_main_~a~0.offset (+ .cse37 (select .cse36 c_main_~a~0.offset) .cse38 .cse39 .cse40 .cse41))))) (store .cse35 .cse31 (+ (select .cse35 .cse31) (select (select (store .cse32 c_main_~a~0.base .cse35) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse34 .cse30 (+ (select (select (store .cse32 c_main_~a~0.base .cse34) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse34 .cse30)))))) (store .cse33 .cse29 (+ (select .cse33 .cse29) (select (select (store .cse32 c_main_~a~0.base .cse33) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse28 (select .cse27 |c_main_~#sum~0.base|))) (let ((.cse23 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse24 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| .cse23)) c_main_~a~0.base) .cse31))) (let ((.cse26 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24))) c_main_~a~0.base) .cse30))) (let ((.cse25 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24 .cse26))) c_main_~a~0.base) .cse29))) (let ((.cse22 (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24 .cse25 .cse26))) c_main_~a~0.base))) (store .cse22 c_main_~a~0.offset (+ .cse23 (select .cse22 c_main_~a~0.offset) .cse24 .cse25 .cse26)))))))))) .cse31 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)))) (not (< (+ c_main_~i~0 2) c_~N~0)) .cse0) (or .cse0 (not (< (+ c_main_~i~0 1) c_~N~0)) (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse55 (+ c_main_~a~0.offset 8))) (store (let ((.cse53 (+ c_main_~a~0.offset 24)) (.cse54 (+ c_main_~a~0.offset 16))) (let ((.cse51 (let ((.cse68 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) 1))) (let ((.cse66 (store |c_#memory_int| c_main_~a~0.base .cse68))) (let ((.cse67 (select .cse66 |c_main_~#sum~0.base|))) (let ((.cse61 (select .cse68 c_main_~a~0.offset)) (.cse63 (select .cse67 |c_main_~#sum~0.offset|))) (let ((.cse65 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse63))) c_main_~a~0.base) .cse55))) (let ((.cse64 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse63 .cse65))) c_main_~a~0.base) .cse54))) (let ((.cse62 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse63 .cse64 .cse65))) c_main_~a~0.base) .cse53))) (let ((.cse56 (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse62 .cse63 .cse64 .cse65))))) (store .cse56 c_main_~a~0.base (let ((.cse57 (let ((.cse58 (let ((.cse59 (let ((.cse60 (select .cse56 c_main_~a~0.base))) (store .cse60 c_main_~a~0.offset (+ .cse61 .cse62 .cse63 (select .cse60 c_main_~a~0.offset) .cse64 .cse65))))) (store .cse59 .cse55 (+ (select .cse59 .cse55) (select (select (store .cse56 c_main_~a~0.base .cse59) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse58 .cse54 (+ (select (select (store .cse56 c_main_~a~0.base .cse58) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse58 .cse54)))))) (store .cse57 .cse53 (+ (select (select (store .cse56 c_main_~a~0.base .cse57) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse57 .cse53))))))))))))))) (let ((.cse52 (select .cse51 |c_main_~#sum~0.base|))) (let ((.cse48 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse50 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| .cse48)) c_main_~a~0.base) .cse55))) (let ((.cse49 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse48 .cse50))) c_main_~a~0.base) .cse54))) (let ((.cse47 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse48 .cse49 .cse50))) c_main_~a~0.base) .cse53))) (let ((.cse46 (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse47 .cse48 .cse49 .cse50))) c_main_~a~0.base))) (store .cse46 c_main_~a~0.offset (+ .cse47 .cse48 (select .cse46 c_main_~a~0.offset) .cse49 .cse50)))))))))) .cse55 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250))))) (or (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse78 (+ c_main_~a~0.offset 8))) (store (let ((.cse76 (+ c_main_~a~0.offset 24)) (.cse77 (+ c_main_~a~0.offset 16))) (let ((.cse74 (let ((.cse91 (let ((.cse92 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse92 8) 1) (+ c_main_~a~0.offset 16 .cse92) 1) (+ c_main_~a~0.offset .cse92 24) 1)))) (let ((.cse89 (store |c_#memory_int| c_main_~a~0.base .cse91))) (let ((.cse90 (select .cse89 |c_main_~#sum~0.base|))) (let ((.cse85 (select .cse90 |c_main_~#sum~0.offset|)) (.cse88 (select .cse91 c_main_~a~0.offset))) (let ((.cse84 (select (select (store .cse89 |c_main_~#sum~0.base| (store .cse90 |c_main_~#sum~0.offset| (+ .cse85 .cse88))) c_main_~a~0.base) .cse78))) (let ((.cse87 (select (select (store .cse89 |c_main_~#sum~0.base| (store .cse90 |c_main_~#sum~0.offset| (+ .cse84 .cse85 .cse88))) c_main_~a~0.base) .cse77))) (let ((.cse86 (select (select (store .cse89 |c_main_~#sum~0.base| (store .cse90 |c_main_~#sum~0.offset| (+ .cse84 .cse85 .cse87 .cse88))) c_main_~a~0.base) .cse76))) (let ((.cse79 (store .cse89 |c_main_~#sum~0.base| (store .cse90 |c_main_~#sum~0.offset| (+ .cse84 .cse85 .cse86 .cse87 .cse88))))) (store .cse79 c_main_~a~0.base (let ((.cse80 (let ((.cse81 (let ((.cse82 (let ((.cse83 (select .cse79 c_main_~a~0.base))) (store .cse83 c_main_~a~0.offset (+ .cse84 .cse85 (select .cse83 c_main_~a~0.offset) .cse86 .cse87 .cse88))))) (store .cse82 .cse78 (+ (select (select (store .cse79 c_main_~a~0.base .cse82) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse82 .cse78)))))) (store .cse81 .cse77 (+ (select .cse81 .cse77) (select (select (store .cse79 c_main_~a~0.base .cse81) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse80 .cse76 (+ (select (select (store .cse79 c_main_~a~0.base .cse80) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse80 .cse76))))))))))))))) (let ((.cse75 (select .cse74 |c_main_~#sum~0.base|))) (let ((.cse72 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse73 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| .cse72)) c_main_~a~0.base) .cse78))) (let ((.cse70 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse72 .cse73))) c_main_~a~0.base) .cse77))) (let ((.cse71 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse70 .cse72 .cse73))) c_main_~a~0.base) .cse76))) (let ((.cse69 (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse70 .cse71 .cse72 .cse73))) c_main_~a~0.base))) (store .cse69 c_main_~a~0.offset (+ .cse70 .cse71 (select .cse69 c_main_~a~0.offset) .cse72 .cse73)))))))))) .cse78 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)))) .cse0 (not (< (+ c_main_~i~0 3) c_~N~0))))) is different from true [2022-01-31 12:15:17,454 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (< 4 c_~N~0))) (and (or .cse0 (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse10 (+ c_main_~a~0.offset 8))) (store (let ((.cse8 (+ c_main_~a~0.offset 24)) (.cse9 (+ c_main_~a~0.offset 16))) (let ((.cse6 (let ((.cse21 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse16 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (.cse18 (select .cse21 |c_main_~#sum~0.offset|))) (let ((.cse20 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse18))) c_main_~a~0.base) .cse10))) (let ((.cse17 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse18 .cse20))) c_main_~a~0.base) .cse9))) (let ((.cse19 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse20))) c_main_~a~0.base) .cse8))) (let ((.cse11 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20))))) (store .cse11 c_main_~a~0.base (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (select .cse11 c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ .cse16 .cse17 (select .cse15 c_main_~a~0.offset) .cse18 .cse19 .cse20))))) (store .cse14 .cse10 (+ (select (select (store .cse11 c_main_~a~0.base .cse14) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse14 .cse10)))))) (store .cse13 .cse9 (+ (select (select (store .cse11 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse13 .cse9)))))) (store .cse12 .cse8 (+ (select .cse12 .cse8) (select (select (store .cse11 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| .cse5)) c_main_~a~0.base) .cse10))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) .cse9))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse5))) c_main_~a~0.base) .cse8))) (let ((.cse1 (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse5))) c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (+ .cse2 .cse3 .cse4 (select .cse1 c_main_~a~0.offset) .cse5)))))))))) .cse10 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250))))) (or .cse0 (not (< (+ c_main_~i~0 1) c_~N~0)) (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse31 (+ c_main_~a~0.offset 8))) (store (let ((.cse29 (+ c_main_~a~0.offset 24)) (.cse30 (+ c_main_~a~0.offset 16))) (let ((.cse27 (let ((.cse44 (let ((.cse45 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse45) 1) (+ c_main_~a~0.offset .cse45 8) 1)))) (let ((.cse42 (store |c_#memory_int| c_main_~a~0.base .cse44))) (let ((.cse43 (select .cse42 |c_main_~#sum~0.base|))) (let ((.cse37 (select .cse43 |c_main_~#sum~0.offset|)) (.cse38 (select .cse44 c_main_~a~0.offset))) (let ((.cse41 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse37 .cse38))) c_main_~a~0.base) .cse31))) (let ((.cse39 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse37 .cse38 .cse41))) c_main_~a~0.base) .cse30))) (let ((.cse40 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse37 .cse38 .cse39 .cse41))) c_main_~a~0.base) .cse29))) (let ((.cse32 (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse37 .cse38 .cse39 .cse40 .cse41))))) (store .cse32 c_main_~a~0.base (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (select .cse32 c_main_~a~0.base))) (store .cse36 c_main_~a~0.offset (+ .cse37 .cse38 .cse39 (select .cse36 c_main_~a~0.offset) .cse40 .cse41))))) (store .cse35 .cse31 (+ (select (select (store .cse32 c_main_~a~0.base .cse35) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse35 .cse31)))))) (store .cse34 .cse30 (+ (select (select (store .cse32 c_main_~a~0.base .cse34) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse34 .cse30)))))) (store .cse33 .cse29 (+ (select .cse33 .cse29) (select (select (store .cse32 c_main_~a~0.base .cse33) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse28 (select .cse27 |c_main_~#sum~0.base|))) (let ((.cse24 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse23 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| .cse24)) c_main_~a~0.base) .cse31))) (let ((.cse25 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24))) c_main_~a~0.base) .cse30))) (let ((.cse26 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24 .cse25))) c_main_~a~0.base) .cse29))) (let ((.cse22 (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24 .cse25 .cse26))) c_main_~a~0.base))) (store .cse22 c_main_~a~0.offset (+ .cse23 .cse24 .cse25 (select .cse22 c_main_~a~0.offset) .cse26)))))))))) .cse31 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250))))) (or (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)) (= (select (store (store (let ((.cse55 (+ c_main_~a~0.offset 8))) (store (let ((.cse53 (+ c_main_~a~0.offset 24)) (.cse54 (+ c_main_~a~0.offset 16))) (let ((.cse51 (let ((.cse68 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) 1))) (let ((.cse66 (store |c_#memory_int| c_main_~a~0.base .cse68))) (let ((.cse67 (select .cse66 |c_main_~#sum~0.base|))) (let ((.cse63 (select .cse68 c_main_~a~0.offset)) (.cse65 (select .cse67 |c_main_~#sum~0.offset|))) (let ((.cse61 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse63 .cse65))) c_main_~a~0.base) .cse55))) (let ((.cse64 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse63 .cse65))) c_main_~a~0.base) .cse54))) (let ((.cse62 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse63 .cse64 .cse65))) c_main_~a~0.base) .cse53))) (let ((.cse56 (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse62 .cse63 .cse64 .cse65))))) (store .cse56 c_main_~a~0.base (let ((.cse57 (let ((.cse58 (let ((.cse59 (let ((.cse60 (select .cse56 c_main_~a~0.base))) (store .cse60 c_main_~a~0.offset (+ .cse61 .cse62 .cse63 .cse64 .cse65 (select .cse60 c_main_~a~0.offset)))))) (store .cse59 .cse55 (+ (select .cse59 .cse55) (select (select (store .cse56 c_main_~a~0.base .cse59) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse58 .cse54 (+ (select (select (store .cse56 c_main_~a~0.base .cse58) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse58 .cse54)))))) (store .cse57 .cse53 (+ (select .cse57 .cse53) (select (select (store .cse56 c_main_~a~0.base .cse57) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse52 (select .cse51 |c_main_~#sum~0.base|))) (let ((.cse50 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse48 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| .cse50)) c_main_~a~0.base) .cse55))) (let ((.cse47 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse48 .cse50))) c_main_~a~0.base) .cse54))) (let ((.cse49 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse47 .cse48 .cse50))) c_main_~a~0.base) .cse53))) (let ((.cse46 (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse47 .cse48 .cse49 .cse50))) c_main_~a~0.base))) (store .cse46 c_main_~a~0.offset (+ .cse47 .cse48 .cse49 .cse50 (select .cse46 c_main_~a~0.offset))))))))))) .cse55 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)))) .cse0 (not (< c_main_~i~0 c_~N~0))) (or (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse78 (+ c_main_~a~0.offset 8))) (store (let ((.cse76 (+ c_main_~a~0.offset 24)) (.cse77 (+ c_main_~a~0.offset 16))) (let ((.cse74 (let ((.cse91 (let ((.cse92 (* c_main_~i~0 8))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse92) 1) (+ c_main_~a~0.offset .cse92 8) 1) (+ c_main_~a~0.offset 16 .cse92) 1)))) (let ((.cse89 (store |c_#memory_int| c_main_~a~0.base .cse91))) (let ((.cse90 (select .cse89 |c_main_~#sum~0.base|))) (let ((.cse84 (select .cse90 |c_main_~#sum~0.offset|)) (.cse87 (select .cse91 c_main_~a~0.offset))) (let ((.cse88 (select (select (store .cse89 |c_main_~#sum~0.base| (store .cse90 |c_main_~#sum~0.offset| (+ .cse84 .cse87))) c_main_~a~0.base) .cse78))) (let ((.cse85 (select (select (store .cse89 |c_main_~#sum~0.base| (store .cse90 |c_main_~#sum~0.offset| (+ .cse84 .cse87 .cse88))) c_main_~a~0.base) .cse77))) (let ((.cse86 (select (select (store .cse89 |c_main_~#sum~0.base| (store .cse90 |c_main_~#sum~0.offset| (+ .cse84 .cse85 .cse87 .cse88))) c_main_~a~0.base) .cse76))) (let ((.cse79 (store .cse89 |c_main_~#sum~0.base| (store .cse90 |c_main_~#sum~0.offset| (+ .cse84 .cse85 .cse86 .cse87 .cse88))))) (store .cse79 c_main_~a~0.base (let ((.cse80 (let ((.cse81 (let ((.cse82 (let ((.cse83 (select .cse79 c_main_~a~0.base))) (store .cse83 c_main_~a~0.offset (+ .cse84 .cse85 .cse86 .cse87 .cse88 (select .cse83 c_main_~a~0.offset)))))) (store .cse82 .cse78 (+ (select .cse82 .cse78) (select (select (store .cse79 c_main_~a~0.base .cse82) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse81 .cse77 (+ (select .cse81 .cse77) (select (select (store .cse79 c_main_~a~0.base .cse81) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse80 .cse76 (+ (select .cse80 .cse76) (select (select (store .cse79 c_main_~a~0.base .cse80) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse75 (select .cse74 |c_main_~#sum~0.base|))) (let ((.cse72 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse71 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| .cse72)) c_main_~a~0.base) .cse78))) (let ((.cse70 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse71 .cse72))) c_main_~a~0.base) .cse77))) (let ((.cse73 (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse70 .cse71 .cse72))) c_main_~a~0.base) .cse76))) (let ((.cse69 (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse70 .cse71 .cse72 .cse73))) c_main_~a~0.base))) (store .cse69 c_main_~a~0.offset (+ (select .cse69 c_main_~a~0.offset) .cse70 .cse71 .cse72 .cse73)))))))))) .cse78 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)))) (not (< (+ c_main_~i~0 2) c_~N~0)) .cse0))) is different from true [2022-01-31 12:15:19,508 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (< 4 c_~N~0))) (and (or .cse0 (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse10 (+ c_main_~a~0.offset 8))) (store (let ((.cse8 (+ c_main_~a~0.offset 24)) (.cse9 (+ c_main_~a~0.offset 16))) (let ((.cse6 (let ((.cse21 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse16 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (.cse18 (select .cse21 |c_main_~#sum~0.offset|))) (let ((.cse20 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse18))) c_main_~a~0.base) .cse10))) (let ((.cse17 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse18 .cse20))) c_main_~a~0.base) .cse9))) (let ((.cse19 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse20))) c_main_~a~0.base) .cse8))) (let ((.cse11 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18 .cse19 .cse20))))) (store .cse11 c_main_~a~0.base (let ((.cse12 (let ((.cse13 (let ((.cse14 (let ((.cse15 (select .cse11 c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ .cse16 .cse17 (select .cse15 c_main_~a~0.offset) .cse18 .cse19 .cse20))))) (store .cse14 .cse10 (+ (select (select (store .cse11 c_main_~a~0.base .cse14) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse14 .cse10)))))) (store .cse13 .cse9 (+ (select (select (store .cse11 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse13 .cse9)))))) (store .cse12 .cse8 (+ (select .cse12 .cse8) (select (select (store .cse11 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse5 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| .cse5)) c_main_~a~0.base) .cse10))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) .cse9))) (let ((.cse3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse4 .cse5))) c_main_~a~0.base) .cse8))) (let ((.cse1 (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse5))) c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (+ .cse2 .cse3 .cse4 (select .cse1 c_main_~a~0.offset) .cse5)))))))))) .cse10 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250))))) (or (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse31 (+ c_main_~a~0.offset 8))) (store (let ((.cse29 (+ c_main_~a~0.offset 24)) (.cse30 (+ c_main_~a~0.offset 16))) (let ((.cse27 (let ((.cse44 (let ((.cse45 (* c_main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse45 8) 1) (+ c_main_~a~0.offset 16 .cse45) 1)))) (let ((.cse42 (store |c_#memory_int| c_main_~a~0.base .cse44))) (let ((.cse43 (select .cse42 |c_main_~#sum~0.base|))) (let ((.cse38 (select .cse44 c_main_~a~0.offset)) (.cse40 (select .cse43 |c_main_~#sum~0.offset|))) (let ((.cse41 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse38 .cse40))) c_main_~a~0.base) .cse31))) (let ((.cse37 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse38 .cse40 .cse41))) c_main_~a~0.base) .cse30))) (let ((.cse39 (select (select (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse37 .cse38 .cse40 .cse41))) c_main_~a~0.base) .cse29))) (let ((.cse32 (store .cse42 |c_main_~#sum~0.base| (store .cse43 |c_main_~#sum~0.offset| (+ .cse37 .cse38 .cse39 .cse40 .cse41))))) (store .cse32 c_main_~a~0.base (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (select .cse32 c_main_~a~0.base))) (store .cse36 c_main_~a~0.offset (+ .cse37 (select .cse36 c_main_~a~0.offset) .cse38 .cse39 .cse40 .cse41))))) (store .cse35 .cse31 (+ (select .cse35 .cse31) (select (select (store .cse32 c_main_~a~0.base .cse35) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse34 .cse30 (+ (select (select (store .cse32 c_main_~a~0.base .cse34) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse34 .cse30)))))) (store .cse33 .cse29 (+ (select .cse33 .cse29) (select (select (store .cse32 c_main_~a~0.base .cse33) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))))))))))))))) (let ((.cse28 (select .cse27 |c_main_~#sum~0.base|))) (let ((.cse23 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse24 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| .cse23)) c_main_~a~0.base) .cse31))) (let ((.cse26 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24))) c_main_~a~0.base) .cse30))) (let ((.cse25 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24 .cse26))) c_main_~a~0.base) .cse29))) (let ((.cse22 (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse23 .cse24 .cse25 .cse26))) c_main_~a~0.base))) (store .cse22 c_main_~a~0.offset (+ .cse23 (select .cse22 c_main_~a~0.offset) .cse24 .cse25 .cse26)))))))))) .cse31 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250)))) (not (< (+ c_main_~i~0 2) c_~N~0)) .cse0) (or .cse0 (not (< (+ c_main_~i~0 1) c_~N~0)) (forall ((v_ArrVal_961 Int) (v_main_~i~0_250 Int) (v_main_~i~0_251 Int) (v_ArrVal_959 Int) (v_ArrVal_964 Int)) (or (not (<= 2 v_main_~i~0_251)) (= (select (store (store (let ((.cse55 (+ c_main_~a~0.offset 8))) (store (let ((.cse53 (+ c_main_~a~0.offset 24)) (.cse54 (+ c_main_~a~0.offset 16))) (let ((.cse51 (let ((.cse68 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) 1))) (let ((.cse66 (store |c_#memory_int| c_main_~a~0.base .cse68))) (let ((.cse67 (select .cse66 |c_main_~#sum~0.base|))) (let ((.cse61 (select .cse68 c_main_~a~0.offset)) (.cse63 (select .cse67 |c_main_~#sum~0.offset|))) (let ((.cse65 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse63))) c_main_~a~0.base) .cse55))) (let ((.cse64 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse63 .cse65))) c_main_~a~0.base) .cse54))) (let ((.cse62 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse63 .cse64 .cse65))) c_main_~a~0.base) .cse53))) (let ((.cse56 (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| (+ .cse61 .cse62 .cse63 .cse64 .cse65))))) (store .cse56 c_main_~a~0.base (let ((.cse57 (let ((.cse58 (let ((.cse59 (let ((.cse60 (select .cse56 c_main_~a~0.base))) (store .cse60 c_main_~a~0.offset (+ .cse61 .cse62 .cse63 (select .cse60 c_main_~a~0.offset) .cse64 .cse65))))) (store .cse59 .cse55 (+ (select .cse59 .cse55) (select (select (store .cse56 c_main_~a~0.base .cse59) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse58 .cse54 (+ (select (select (store .cse56 c_main_~a~0.base .cse58) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse58 .cse54)))))) (store .cse57 .cse53 (+ (select (select (store .cse56 c_main_~a~0.base .cse57) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse57 .cse53))))))))))))))) (let ((.cse52 (select .cse51 |c_main_~#sum~0.base|))) (let ((.cse48 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| 0)) c_main_~a~0.base) c_main_~a~0.offset))) (let ((.cse50 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| .cse48)) c_main_~a~0.base) .cse55))) (let ((.cse49 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse48 .cse50))) c_main_~a~0.base) .cse54))) (let ((.cse47 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse48 .cse49 .cse50))) c_main_~a~0.base) .cse53))) (let ((.cse46 (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse47 .cse48 .cse49 .cse50))) c_main_~a~0.base))) (store .cse46 c_main_~a~0.offset (+ .cse47 .cse48 (select .cse46 c_main_~a~0.offset) .cse49 .cse50)))))))))) .cse55 v_ArrVal_959)) (+ (* 8 v_main_~i~0_251) c_main_~a~0.offset) v_ArrVal_961) (+ c_main_~a~0.offset (* 8 v_main_~i~0_250)) v_ArrVal_964) c_main_~a~0.offset) (+ (* c_~N~0 2) (* c_~N~0 c_~N~0) 1)) (not (<= (+ v_main_~i~0_251 1) v_main_~i~0_250))))))) is different from true [2022-01-31 12:15:44,941 WARN L228 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 198 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)