/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-patterns/array7_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 10:31:28,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 10:31:28,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 10:31:28,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 10:31:28,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 10:31:28,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 10:31:28,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 10:31:28,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 10:31:28,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 10:31:28,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 10:31:28,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 10:31:28,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 10:31:28,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 10:31:28,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 10:31:28,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 10:31:28,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 10:31:28,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 10:31:28,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 10:31:28,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 10:31:28,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 10:31:28,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 10:31:28,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 10:31:28,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 10:31:28,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 10:31:28,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 10:31:28,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 10:31:28,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 10:31:28,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 10:31:28,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 10:31:28,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 10:31:28,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 10:31:28,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 10:31:28,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 10:31:28,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 10:31:28,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 10:31:28,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 10:31:28,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 10:31:28,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 10:31:28,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 10:31:28,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 10:31:28,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 10:31:28,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 10:31:28,475 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 10:31:28,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 10:31:28,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 10:31:28,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 10:31:28,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 10:31:28,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 10:31:28,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 10:31:28,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 10:31:28,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 10:31:28,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 10:31:28,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 10:31:28,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 10:31:28,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 10:31:28,479 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 10:31:28,479 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 10:31:28,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 10:31:28,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 10:31:28,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 10:31:28,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 10:31:28,707 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 10:31:28,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array7_pattern.c [2022-01-31 10:31:28,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a311e2361/e04ddd6de3c34caf883a1d567d6ffe67/FLAG3652b7f52 [2022-01-31 10:31:29,166 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 10:31:29,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array7_pattern.c [2022-01-31 10:31:29,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a311e2361/e04ddd6de3c34caf883a1d567d6ffe67/FLAG3652b7f52 [2022-01-31 10:31:29,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a311e2361/e04ddd6de3c34caf883a1d567d6ffe67 [2022-01-31 10:31:29,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 10:31:29,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 10:31:29,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 10:31:29,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 10:31:29,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 10:31:29,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4523e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29, skipping insertion in model container [2022-01-31 10:31:29,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 10:31:29,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 10:31:29,765 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-patterns/array7_pattern.c[1375,1388] [2022-01-31 10:31:29,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 10:31:29,808 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 10:31:29,823 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-patterns/array7_pattern.c[1375,1388] [2022-01-31 10:31:29,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 10:31:29,869 INFO L208 MainTranslator]: Completed translation [2022-01-31 10:31:29,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29 WrapperNode [2022-01-31 10:31:29,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 10:31:29,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 10:31:29,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 10:31:29,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 10:31:29,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 10:31:29,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 10:31:29,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 10:31:29,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 10:31:29,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (1/1) ... [2022-01-31 10:31:29,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 10:31:29,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:31:29,940 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 10:31:29,962 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 10:31:29,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 10:31:29,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 10:31:29,983 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 10:31:29,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 10:31:29,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 10:31:29,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 10:31:29,984 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 10:31:29,984 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 10:31:29,984 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 10:31:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 10:31:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 10:31:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 10:31:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 10:31:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-01-31 10:31:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 10:31:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 10:31:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 10:31:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 10:31:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 10:31:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 10:31:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 10:31:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 10:31:30,064 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 10:31:30,065 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 10:31:30,264 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 10:31:30,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 10:31:30,269 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 10:31:30,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:31:30 BoogieIcfgContainer [2022-01-31 10:31:30,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 10:31:30,272 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 10:31:30,272 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 10:31:30,279 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 10:31:30,285 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:31:30" (1/1) ... [2022-01-31 10:31:30,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:31:30 BasicIcfg [2022-01-31 10:31:30,315 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 10:31:30,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 10:31:30,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 10:31:30,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 10:31:30,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 10:31:29" (1/4) ... [2022-01-31 10:31:30,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20392e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:31:30, skipping insertion in model container [2022-01-31 10:31:30,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 10:31:29" (2/4) ... [2022-01-31 10:31:30,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20392e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 10:31:30, skipping insertion in model container [2022-01-31 10:31:30,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 10:31:30" (3/4) ... [2022-01-31 10:31:30,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20392e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 10:31:30, skipping insertion in model container [2022-01-31 10:31:30,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 10:31:30" (4/4) ... [2022-01-31 10:31:30,323 INFO L111 eAbstractionObserver]: Analyzing ICFG array7_pattern.cJordan [2022-01-31 10:31:30,327 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 10:31:30,328 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 10:31:30,373 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 10:31:30,380 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 10:31:30,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 10:31:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 10:31:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 10:31:30,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:31:30,406 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] [2022-01-31 10:31:30,407 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:31:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:31:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1824208926, now seen corresponding path program 1 times [2022-01-31 10:31:30,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:31:30,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361202234] [2022-01-31 10:31:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:31:30,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:31:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:30,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:31:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:30,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:31:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:30,614 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 10:31:30,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:31:30,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361202234] [2022-01-31 10:31:30,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361202234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:31:30,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:31:30,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 10:31:30,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789287292] [2022-01-31 10:31:30,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:31:30,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 10:31:30,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:31:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 10:31:30,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 10:31:30,649 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 10:31:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:31:30,742 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-01-31 10:31:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 10:31:30,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-01-31 10:31:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:31:30,749 INFO L225 Difference]: With dead ends: 34 [2022-01-31 10:31:30,750 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 10:31:30,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 10:31:30,754 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:31:30,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:31:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 10:31:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-31 10:31:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 10:31:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-31 10:31:30,784 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2022-01-31 10:31:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:31:30,785 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-31 10:31:30,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 10:31:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-31 10:31:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 10:31:30,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:31:30,787 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:31:30,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 10:31:30,787 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:31:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:31:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash 550617510, now seen corresponding path program 1 times [2022-01-31 10:31:30,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:31:30,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394337155] [2022-01-31 10:31:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:31:30,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:31:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:30,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:31:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:30,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:31:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 10:31:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:31:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:31:31,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:31:31,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394337155] [2022-01-31 10:31:31,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394337155] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:31:31,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:31:31,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 10:31:31,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351425448] [2022-01-31 10:31:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:31:31,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 10:31:31,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:31:31,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 10:31:31,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 10:31:31,023 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 10:31:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:31:31,130 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-01-31 10:31:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 10:31:31,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-01-31 10:31:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:31:31,132 INFO L225 Difference]: With dead ends: 31 [2022-01-31 10:31:31,132 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 10:31:31,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 10:31:31,138 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:31:31,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 81 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:31:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 10:31:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-31 10:31:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 10:31:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-31 10:31:31,153 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 32 [2022-01-31 10:31:31,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:31:31,155 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-31 10:31:31,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 10:31:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-31 10:31:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 10:31:31,156 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:31:31,156 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 10:31:31,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 10:31:31,156 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:31:31,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:31:31,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1770062402, now seen corresponding path program 1 times [2022-01-31 10:31:31,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:31:31,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282770760] [2022-01-31 10:31:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:31:31,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:31:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 10:31:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 10:31:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 10:31:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 10:31:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:31:31,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:31:31,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282770760] [2022-01-31 10:31:31,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282770760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 10:31:31,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 10:31:31,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 10:31:31,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828422048] [2022-01-31 10:31:31,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 10:31:31,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 10:31:31,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:31:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 10:31:31,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-31 10:31:31,308 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 10:31:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:31:31,402 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-01-31 10:31:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 10:31:31,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-01-31 10:31:31,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:31:31,404 INFO L225 Difference]: With dead ends: 42 [2022-01-31 10:31:31,404 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 10:31:31,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 10:31:31,405 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:31:31,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:31:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 10:31:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-01-31 10:31:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 10:31:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-31 10:31:31,410 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 34 [2022-01-31 10:31:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:31:31,410 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-31 10:31:31,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 10:31:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-31 10:31:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 10:31:31,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:31:31,411 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 10:31:31,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 10:31:31,412 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:31:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:31:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 972866280, now seen corresponding path program 1 times [2022-01-31 10:31:31,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:31:31,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899483218] [2022-01-31 10:31:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:31:31,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:31:31,425 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 10:31:31,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278328107] [2022-01-31 10:31:31,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:31:31,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:31:31,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:31:31,431 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 10:31:31,453 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 10:31:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:31:31,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 10:31:31,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:31:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 10:31:31,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:31:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 10:31:32,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:31:32,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899483218] [2022-01-31 10:31:32,094 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 10:31:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278328107] [2022-01-31 10:31:32,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278328107] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:31:32,095 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:31:32,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2022-01-31 10:31:32,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832527796] [2022-01-31 10:31:32,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:31:32,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 10:31:32,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:31:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 10:31:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-01-31 10:31:32,100 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 10:31:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:31:32,317 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-01-31 10:31:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 10:31:32,317 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2022-01-31 10:31:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:31:32,319 INFO L225 Difference]: With dead ends: 63 [2022-01-31 10:31:32,319 INFO L226 Difference]: Without dead ends: 49 [2022-01-31 10:31:32,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-01-31 10:31:32,327 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:31:32,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 156 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:31:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-31 10:31:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-01-31 10:31:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 10:31:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-31 10:31:32,333 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2022-01-31 10:31:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:31:32,333 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-31 10:31:32,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-31 10:31:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-31 10:31:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 10:31:32,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:31:32,335 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:31:32,359 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 10:31:32,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:31:32,556 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:31:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:31:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1874202700, now seen corresponding path program 2 times [2022-01-31 10:31:32,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:31:32,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129223744] [2022-01-31 10:31:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:31:32,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:31:32,576 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 10:31:32,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263692731] [2022-01-31 10:31:32,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 10:31:32,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:31:32,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:31:32,577 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 10:31:32,583 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 10:31:32,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 10:31:32,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:31:32,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 10:31:32,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:31:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 10:31:32,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:31:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-31 10:31:32,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:31:32,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129223744] [2022-01-31 10:31:32,987 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 10:31:32,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263692731] [2022-01-31 10:31:32,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263692731] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:31:32,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:31:32,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 10:31:32,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62084100] [2022-01-31 10:31:32,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:31:32,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 10:31:32,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:31:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 10:31:32,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 10:31:32,989 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 10:31:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:31:33,113 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-01-31 10:31:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 10:31:33,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2022-01-31 10:31:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:31:33,114 INFO L225 Difference]: With dead ends: 40 [2022-01-31 10:31:33,114 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 10:31:33,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 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 10:31:33,115 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:31:33,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 103 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:31:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 10:31:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-01-31 10:31:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 10:31:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-01-31 10:31:33,120 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 40 [2022-01-31 10:31:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:31:33,120 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-01-31 10:31:33,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 10:31:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-01-31 10:31:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 10:31:33,121 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:31:33,121 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:31:33,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 10:31:33,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:31:33,327 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:31:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:31:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash -609884976, now seen corresponding path program 3 times [2022-01-31 10:31:33,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:31:33,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285804871] [2022-01-31 10:31:33,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:31:33,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:31:33,340 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 10:31:33,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [615231309] [2022-01-31 10:31:33,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 10:31:33,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:31:33,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:31:33,345 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 10:31:33,346 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 10:31:33,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 10:31:33,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:31:33,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 10:31:33,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:31:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 10:31:33,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:31:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 10:31:33,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:31:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285804871] [2022-01-31 10:31:33,796 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 10:31:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615231309] [2022-01-31 10:31:33,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615231309] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:31:33,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:31:33,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-01-31 10:31:33,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10857747] [2022-01-31 10:31:33,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:31:33,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 10:31:33,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:31:33,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 10:31:33,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-31 10:31:33,799 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 10:31:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:31:33,969 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-31 10:31:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 10:31:33,970 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-01-31 10:31:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:31:33,971 INFO L225 Difference]: With dead ends: 49 [2022-01-31 10:31:33,972 INFO L226 Difference]: Without dead ends: 49 [2022-01-31 10:31:33,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2022-01-31 10:31:33,973 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:31:33,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 130 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:31:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-31 10:31:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2022-01-31 10:31:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 10:31:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-01-31 10:31:33,978 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 42 [2022-01-31 10:31:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:31:33,978 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-01-31 10:31:33,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 10:31:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-01-31 10:31:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 10:31:33,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:31:33,980 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:31:34,005 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 10:31:34,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:31:34,202 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:31:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:31:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1076296980, now seen corresponding path program 4 times [2022-01-31 10:31:34,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:31:34,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274543240] [2022-01-31 10:31:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:31:34,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:31:34,218 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 10:31:34,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561354055] [2022-01-31 10:31:34,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 10:31:34,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:31:34,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:31:34,232 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 10:31:34,233 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 10:31:34,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 10:31:34,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:31:34,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-31 10:31:34,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:31:34,815 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 10:31:34,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:34,856 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-01-31 10:31:34,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 15 [2022-01-31 10:31:34,867 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 33 treesize of output 32 [2022-01-31 10:31:34,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:34,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:34,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 67 [2022-01-31 10:31:35,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:35,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:35,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:35,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:35,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:35,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-01-31 10:31:36,020 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-31 10:31:36,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 708 treesize of output 663 [2022-01-31 10:31:36,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 230 [2022-01-31 10:31:36,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:31:36,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:31:36,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 359 [2022-01-31 10:31:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:31:36,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:31:36,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:31:36,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 262 [2022-01-31 10:31:36,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 94 [2022-01-31 10:31:36,344 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 20 treesize of output 11 [2022-01-31 10:31:36,384 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 19 treesize of output 11 [2022-01-31 10:31:36,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 100 [2022-01-31 10:31:36,462 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 10:31:36,490 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 10:31:36,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:36,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 73 [2022-01-31 10:31:37,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:37,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:37,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:37,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:37,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:31:37,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:31:37,650 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-01-31 10:31:37,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 157 treesize of output 45 [2022-01-31 10:31:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 10:31:37,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:31:42,321 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse17 (<= (mod c_main_~index~0 4294967296) 2147483647)) (.cse1 (<= (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296) 2147483647))) (let ((.cse32 (not .cse1)) (.cse2 (not .cse17)) (.cse0 (<= (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296) 2147483647))) (and (or (not .cse0) (and (or .cse1 (and (or .cse2 (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (= (let ((.cse6 (* 4 (mod c_main_~index~0 4294967296))) (.cse7 (* 4 (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296))) (.cse8 (* 4 (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296)))) (let ((.cse3 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ |c_main_~#array2~0.offset| .cse6) (let ((.cse9 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse9 (+ (- 17179869184) |c_main_~#array2~0.offset| .cse7)) (select .cse9 (+ .cse8 |c_main_~#array2~0.offset|))))))) (let ((.cse4 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse5 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse5 (+ .cse6 |c_main_~#array1~0.offset|) (+ (select .cse5 (+ (- 17179869184) |c_main_~#array1~0.offset| .cse7)) (select .cse5 (+ .cse8 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse3) |c_main_~#array1~0.base|))) (+ (select .cse3 (+ |c_main_~#array2~0.offset| 4)) (select .cse4 (+ 8 |c_main_~#array1~0.offset|)) (select .cse3 |c_main_~#array2~0.offset|) (select .cse4 |c_main_~#array1~0.offset|) (select .cse4 (+ |c_main_~#array1~0.offset| 4)) (select .cse3 (+ |c_main_~#array2~0.offset| 8)) c_main_~sum~0)))) 0))) (or (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (= (let ((.cse13 (* 4 (mod c_main_~index~0 4294967296))) (.cse14 (* 4 (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296))) (.cse15 (* 4 (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296)))) (let ((.cse10 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ (- 17179869184) |c_main_~#array2~0.offset| .cse13) (let ((.cse16 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse16 (+ (- 17179869184) |c_main_~#array2~0.offset| .cse14)) (select .cse16 (+ .cse15 |c_main_~#array2~0.offset|))))))) (let ((.cse11 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse12 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse12 (+ .cse13 |c_main_~#array1~0.offset|) (+ (select .cse12 (+ (- 17179869184) |c_main_~#array1~0.offset| .cse14)) (select .cse12 (+ .cse15 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse10) |c_main_~#array1~0.base|))) (+ (select .cse10 (+ |c_main_~#array2~0.offset| 4)) (select .cse11 (+ 8 |c_main_~#array1~0.offset|)) (select .cse11 |c_main_~#array1~0.offset|) (select .cse10 (+ |c_main_~#array2~0.offset| 8)) (select .cse10 |c_main_~#array2~0.offset|) (select .cse11 (+ |c_main_~#array1~0.offset| 4)) c_main_~sum~0)))) 0)) .cse17))) (or (and (or (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (= (let ((.cse21 (* 4 (mod c_main_~index~0 4294967296))) (.cse23 (* 4 (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296))) (.cse22 (* 4 (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296)))) (let ((.cse18 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ (- 17179869184) |c_main_~#array2~0.offset| .cse21) (let ((.cse24 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse24 (+ .cse23 |c_main_~#array2~0.offset|)) (select .cse24 (+ |c_main_~#array2~0.offset| .cse22))))))) (let ((.cse19 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse20 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse20 (+ .cse21 |c_main_~#array1~0.offset|) (+ (select .cse20 (+ |c_main_~#array1~0.offset| .cse22)) (select .cse20 (+ .cse23 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse18) |c_main_~#array1~0.base|))) (+ (select .cse18 (+ |c_main_~#array2~0.offset| 4)) (select .cse18 (+ |c_main_~#array2~0.offset| 8)) (select .cse19 |c_main_~#array1~0.offset|) (select .cse19 (+ 8 |c_main_~#array1~0.offset|)) (select .cse18 |c_main_~#array2~0.offset|) (select .cse19 (+ |c_main_~#array1~0.offset| 4)) c_main_~sum~0)))) 0)) .cse17) (or (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (= (let ((.cse28 (* 4 (mod c_main_~index~0 4294967296))) (.cse30 (* 4 (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296))) (.cse29 (* 4 (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296)))) (let ((.cse26 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ |c_main_~#array2~0.offset| .cse28) (let ((.cse31 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse31 (+ .cse30 |c_main_~#array2~0.offset|)) (select .cse31 (+ |c_main_~#array2~0.offset| .cse29))))))) (let ((.cse25 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse27 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse27 (+ .cse28 |c_main_~#array1~0.offset|) (+ (select .cse27 (+ |c_main_~#array1~0.offset| .cse29)) (select .cse27 (+ .cse30 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse26) |c_main_~#array1~0.base|))) (+ (select .cse25 (+ |c_main_~#array1~0.offset| 4)) (select .cse26 (+ |c_main_~#array2~0.offset| 4)) (select .cse25 (+ 8 |c_main_~#array1~0.offset|)) (select .cse26 (+ |c_main_~#array2~0.offset| 8)) (select .cse26 |c_main_~#array2~0.offset|) c_main_~sum~0 (select .cse25 |c_main_~#array1~0.offset|))))) 0)) .cse2)) .cse32))) (or (and (or .cse32 (and (or (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (= (let ((.cse36 (* 4 (mod c_main_~index~0 4294967296))) (.cse37 (* 4 (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296))) (.cse38 (* 4 (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296)))) (let ((.cse34 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ |c_main_~#array2~0.offset| .cse36) (let ((.cse39 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse39 (+ |c_main_~#array2~0.offset| .cse37)) (select .cse39 (+ (- 17179869184) .cse38 |c_main_~#array2~0.offset|))))))) (let ((.cse33 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse35 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse35 (+ .cse36 |c_main_~#array1~0.offset|) (+ (select .cse35 (+ |c_main_~#array1~0.offset| .cse37)) (select .cse35 (+ (- 17179869184) .cse38 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse34) |c_main_~#array1~0.base|))) (+ (select .cse33 (+ |c_main_~#array1~0.offset| 4)) (select .cse34 (+ |c_main_~#array2~0.offset| 8)) (select .cse33 |c_main_~#array1~0.offset|) (select .cse34 |c_main_~#array2~0.offset|) (select .cse34 (+ |c_main_~#array2~0.offset| 4)) c_main_~sum~0 (select .cse33 (+ 8 |c_main_~#array1~0.offset|)))))) 0)) .cse2) (or (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (= (let ((.cse43 (* 4 (mod c_main_~index~0 4294967296))) (.cse44 (* 4 (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296))) (.cse45 (* 4 (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296)))) (let ((.cse40 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ (- 17179869184) |c_main_~#array2~0.offset| .cse43) (let ((.cse46 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse46 (+ |c_main_~#array2~0.offset| .cse44)) (select .cse46 (+ (- 17179869184) .cse45 |c_main_~#array2~0.offset|))))))) (let ((.cse41 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse42 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse42 (+ .cse43 |c_main_~#array1~0.offset|) (+ (select .cse42 (+ |c_main_~#array1~0.offset| .cse44)) (select .cse42 (+ (- 17179869184) .cse45 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse40) |c_main_~#array1~0.base|))) (+ (select .cse40 (+ |c_main_~#array2~0.offset| 8)) (select .cse41 |c_main_~#array1~0.offset|) (select .cse40 (+ |c_main_~#array2~0.offset| 4)) (select .cse40 |c_main_~#array2~0.offset|) (select .cse41 (+ |c_main_~#array1~0.offset| 4)) c_main_~sum~0 (select .cse41 (+ 8 |c_main_~#array1~0.offset|)))))) 0)) .cse17))) (or .cse1 (and (or .cse2 (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (= (let ((.cse50 (* 4 (mod c_main_~index~0 4294967296))) (.cse51 (* 4 (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296))) (.cse52 (* 4 (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296)))) (let ((.cse47 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ |c_main_~#array2~0.offset| .cse50) (let ((.cse53 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse53 (+ (- 17179869184) |c_main_~#array2~0.offset| .cse51)) (select .cse53 (+ (- 17179869184) .cse52 |c_main_~#array2~0.offset|))))))) (let ((.cse48 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse49 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse49 (+ .cse50 |c_main_~#array1~0.offset|) (+ (select .cse49 (+ (- 17179869184) |c_main_~#array1~0.offset| .cse51)) (select .cse49 (+ (- 17179869184) .cse52 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse47) |c_main_~#array1~0.base|))) (+ (select .cse47 (+ |c_main_~#array2~0.offset| 8)) (select .cse48 (+ |c_main_~#array1~0.offset| 4)) (select .cse48 |c_main_~#array1~0.offset|) (select .cse47 (+ |c_main_~#array2~0.offset| 4)) (select .cse47 |c_main_~#array2~0.offset|) (select .cse48 (+ 8 |c_main_~#array1~0.offset|)) c_main_~sum~0)))) 0))) (or (forall ((v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (= (let ((.cse57 (* 4 (mod c_main_~index~0 4294967296))) (.cse58 (* 4 (mod (+ c_main_~index~0 c_main_~pivot~0) 4294967296))) (.cse59 (* 4 (mod (+ (* 4294967295 c_main_~pivot~0) c_main_~index~0) 4294967296)))) (let ((.cse55 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ (- 17179869184) |c_main_~#array2~0.offset| .cse57) (let ((.cse60 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse60 (+ (- 17179869184) |c_main_~#array2~0.offset| .cse58)) (select .cse60 (+ (- 17179869184) .cse59 |c_main_~#array2~0.offset|))))))) (let ((.cse54 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse56 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse56 (+ .cse57 |c_main_~#array1~0.offset|) (+ (select .cse56 (+ (- 17179869184) |c_main_~#array1~0.offset| .cse58)) (select .cse56 (+ (- 17179869184) .cse59 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse55) |c_main_~#array1~0.base|))) (+ (select .cse54 (+ |c_main_~#array1~0.offset| 4)) (select .cse55 (+ |c_main_~#array2~0.offset| 4)) (select .cse54 (+ 8 |c_main_~#array1~0.offset|)) (select .cse55 |c_main_~#array2~0.offset|) (select .cse54 |c_main_~#array1~0.offset|) c_main_~sum~0 (select .cse55 (+ |c_main_~#array2~0.offset| 8)))))) 0)) .cse17)))) .cse0)))) is different from false [2022-01-31 10:32:42,892 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((aux_div_aux_mod_main_~index~0_63_65 Int) (aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 Int) (aux_div_main_~index~0_63 Int) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (aux_div_aux_mod_aux_mod_main_~index~0_63_65_85 Int)) (let ((.cse13 (* aux_div_aux_mod_main_~index~0_63_65 4294967296)) (.cse12 (* 4294967296 aux_div_aux_mod_aux_mod_main_~index~0_63_65_85))) (let ((.cse1 (+ .cse12 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85)) (.cse0 (* 4294967295 c_main_~pivot~0)) (.cse11 (* 4294967297 c_main_~pivot~0)) (.cse10 (+ .cse12 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse13)) (.cse9 (+ .cse12 (* aux_div_main_~index~0_63 4294967296) aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse13))) (or (<= 4294967296 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) (< (+ 2147483647 .cse0) .cse1) (= (let ((.cse5 (* (mod aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 4294967296) 4)) (.cse7 (* (mod (+ aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 c_main_~pivot~0) 4294967296) 4)) (.cse6 (* (mod (+ .cse0 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) 4294967296) 4))) (let ((.cse3 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ (- 17179869184) |c_main_~#array2~0.offset| .cse5) (let ((.cse8 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse8 (+ .cse7 |c_main_~#array2~0.offset|)) (select .cse8 (+ (- 17179869184) .cse6 |c_main_~#array2~0.offset|))))))) (let ((.cse2 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse4 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse4 (+ .cse5 |c_main_~#array1~0.offset|) (+ (select .cse4 (+ (- 17179869184) .cse6 |c_main_~#array1~0.offset|)) (select .cse4 (+ .cse7 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse3) |c_main_~#array1~0.base|))) (+ (select .cse2 (+ 8 |c_main_~#array1~0.offset|)) (select .cse2 (+ |c_main_~#array1~0.offset| 4)) (select .cse3 (+ |c_main_~#array2~0.offset| 4)) (select .cse3 |c_main_~#array2~0.offset|) (select .cse3 (+ |c_main_~#array2~0.offset| 8)) (select .cse2 |c_main_~#array1~0.offset|) c_main_~sum~0)))) 0) (< .cse1 .cse0) (<= (+ (* c_main_~pivot~0 8589934591) c_~ARR_SIZE~0) .cse9) (<= .cse10 (+ 2147483647 .cse11)) (<= (+ .cse11 4294967296) .cse10) (<= aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 2147483647) (< .cse9 (* 8589934593 c_main_~pivot~0)))))) (forall ((aux_div_aux_mod_main_~index~0_63_65 Int) (aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 Int) (aux_div_main_~index~0_63 Int) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (aux_div_aux_mod_aux_mod_main_~index~0_63_65_85 Int)) (let ((.cse27 (* aux_div_aux_mod_main_~index~0_63_65 4294967296)) (.cse26 (* 4294967296 aux_div_aux_mod_aux_mod_main_~index~0_63_65_85))) (let ((.cse15 (+ .cse26 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85)) (.cse14 (* 4294967295 c_main_~pivot~0)) (.cse25 (+ .cse26 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse27)) (.cse24 (* 4294967297 c_main_~pivot~0)) (.cse16 (+ .cse26 (* aux_div_main_~index~0_63 4294967296) aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse27))) (or (< 2147483647 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) (< (+ 2147483647 .cse14) .cse15) (< .cse15 .cse14) (<= (+ (* c_main_~pivot~0 8589934591) c_~ARR_SIZE~0) .cse16) (= (let ((.cse20 (* (mod aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 4294967296) 4)) (.cse21 (* (mod (+ .cse14 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) 4294967296) 4)) (.cse22 (* (mod (+ aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 c_main_~pivot~0) 4294967296) 4))) (let ((.cse17 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ |c_main_~#array2~0.offset| .cse20) (let ((.cse23 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse23 (+ .cse21 |c_main_~#array2~0.offset|)) (select .cse23 (+ .cse22 |c_main_~#array2~0.offset|))))))) (let ((.cse18 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse19 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse19 (+ .cse20 |c_main_~#array1~0.offset|) (+ (select .cse19 (+ .cse21 |c_main_~#array1~0.offset|)) (select .cse19 (+ .cse22 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse17) |c_main_~#array1~0.base|))) (+ (select .cse17 |c_main_~#array2~0.offset|) (select .cse18 |c_main_~#array1~0.offset|) (select .cse18 (+ |c_main_~#array1~0.offset| 4)) (select .cse18 (+ 8 |c_main_~#array1~0.offset|)) (select .cse17 (+ |c_main_~#array2~0.offset| 4)) (select .cse17 (+ |c_main_~#array2~0.offset| 8)) c_main_~sum~0)))) 0) (< aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 0) (< (+ 2147483647 .cse24) .cse25) (< .cse25 .cse24) (< .cse16 (* 8589934593 c_main_~pivot~0)))))) (forall ((aux_div_aux_mod_main_~index~0_63_65 Int) (aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 Int) (aux_div_main_~index~0_63 Int) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (aux_div_aux_mod_aux_mod_main_~index~0_63_65_85 Int)) (let ((.cse41 (* aux_div_aux_mod_main_~index~0_63_65 4294967296)) (.cse40 (* 4294967296 aux_div_aux_mod_aux_mod_main_~index~0_63_65_85))) (let ((.cse36 (* 4294967295 c_main_~pivot~0)) (.cse37 (+ .cse40 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85)) (.cse39 (+ .cse40 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse41)) (.cse38 (* 4294967297 c_main_~pivot~0)) (.cse28 (+ .cse40 (* aux_div_main_~index~0_63 4294967296) aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse41))) (or (< 2147483647 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) (<= (+ (* c_main_~pivot~0 8589934591) c_~ARR_SIZE~0) .cse28) (= (let ((.cse32 (* (mod aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 4294967296) 4)) (.cse34 (* (mod (+ .cse36 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) 4294967296) 4)) (.cse33 (* (mod (+ aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 c_main_~pivot~0) 4294967296) 4))) (let ((.cse29 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ |c_main_~#array2~0.offset| .cse32) (let ((.cse35 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse35 (+ .cse34 |c_main_~#array2~0.offset|)) (select .cse35 (+ .cse33 (- 17179869184) |c_main_~#array2~0.offset|))))))) (let ((.cse30 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse31 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse31 (+ .cse32 |c_main_~#array1~0.offset|) (+ (select .cse31 (+ .cse33 (- 17179869184) |c_main_~#array1~0.offset|)) (select .cse31 (+ .cse34 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse29) |c_main_~#array1~0.base|))) (+ (select .cse29 |c_main_~#array2~0.offset|) (select .cse29 (+ |c_main_~#array2~0.offset| 4)) (select .cse30 (+ 8 |c_main_~#array1~0.offset|)) (select .cse30 |c_main_~#array1~0.offset|) (select .cse30 (+ |c_main_~#array1~0.offset| 4)) (select .cse29 (+ |c_main_~#array2~0.offset| 8)) c_main_~sum~0)))) 0) (<= .cse37 (+ 2147483647 .cse36)) (<= (+ .cse36 4294967296) .cse37) (< aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 0) (< (+ 2147483647 .cse38) .cse39) (< .cse39 .cse38) (< .cse28 (* 8589934593 c_main_~pivot~0)))))) (forall ((aux_div_aux_mod_main_~index~0_63_65 Int) (aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 Int) (aux_div_main_~index~0_63 Int) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (aux_div_aux_mod_aux_mod_main_~index~0_63_65_85 Int)) (let ((.cse55 (* aux_div_aux_mod_main_~index~0_63_65 4294967296)) (.cse54 (* 4294967296 aux_div_aux_mod_aux_mod_main_~index~0_63_65_85))) (let ((.cse43 (+ .cse54 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85)) (.cse42 (* 4294967295 c_main_~pivot~0)) (.cse53 (+ .cse54 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse55)) (.cse52 (* 4294967297 c_main_~pivot~0)) (.cse44 (+ .cse54 (* aux_div_main_~index~0_63 4294967296) aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse55))) (or (<= 4294967296 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) (< (+ 2147483647 .cse42) .cse43) (< .cse43 .cse42) (<= (+ (* c_main_~pivot~0 8589934591) c_~ARR_SIZE~0) .cse44) (= (let ((.cse48 (* (mod aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 4294967296) 4)) (.cse49 (* (mod (+ .cse42 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) 4294967296) 4)) (.cse50 (* (mod (+ aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 c_main_~pivot~0) 4294967296) 4))) (let ((.cse46 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ (- 17179869184) |c_main_~#array2~0.offset| .cse48) (let ((.cse51 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse51 (+ .cse49 |c_main_~#array2~0.offset|)) (select .cse51 (+ .cse50 |c_main_~#array2~0.offset|))))))) (let ((.cse45 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse47 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse47 (+ .cse48 |c_main_~#array1~0.offset|) (+ (select .cse47 (+ .cse49 |c_main_~#array1~0.offset|)) (select .cse47 (+ .cse50 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse46) |c_main_~#array1~0.base|))) (+ (select .cse45 |c_main_~#array1~0.offset|) (select .cse46 |c_main_~#array2~0.offset|) (select .cse45 (+ |c_main_~#array1~0.offset| 4)) (select .cse46 (+ |c_main_~#array2~0.offset| 8)) (select .cse45 (+ 8 |c_main_~#array1~0.offset|)) (select .cse46 (+ |c_main_~#array2~0.offset| 4)) c_main_~sum~0)))) 0) (<= aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 2147483647) (< (+ 2147483647 .cse52) .cse53) (< .cse53 .cse52) (< .cse44 (* 8589934593 c_main_~pivot~0)))))) (forall ((aux_div_aux_mod_main_~index~0_63_65 Int) (aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 Int) (aux_div_main_~index~0_63 Int) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (aux_div_aux_mod_aux_mod_main_~index~0_63_65_85 Int)) (let ((.cse69 (* aux_div_aux_mod_main_~index~0_63_65 4294967296)) (.cse68 (* 4294967296 aux_div_aux_mod_aux_mod_main_~index~0_63_65_85))) (let ((.cse66 (* 4294967295 c_main_~pivot~0)) (.cse67 (+ .cse68 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85)) (.cse58 (* 4294967297 c_main_~pivot~0)) (.cse57 (+ .cse68 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse69)) (.cse56 (+ .cse68 (* aux_div_main_~index~0_63 4294967296) aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse69))) (or (<= 4294967296 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) (<= (+ (* c_main_~pivot~0 8589934591) c_~ARR_SIZE~0) .cse56) (<= .cse57 (+ 2147483647 .cse58)) (= (let ((.cse62 (* (mod aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 4294967296) 4)) (.cse64 (* (mod (+ aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 c_main_~pivot~0) 4294967296) 4)) (.cse63 (* (mod (+ .cse66 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) 4294967296) 4))) (let ((.cse60 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ (- 17179869184) |c_main_~#array2~0.offset| .cse62) (let ((.cse65 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse65 (+ .cse64 (- 17179869184) |c_main_~#array2~0.offset|)) (select .cse65 (+ (- 17179869184) .cse63 |c_main_~#array2~0.offset|))))))) (let ((.cse59 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse61 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse61 (+ .cse62 |c_main_~#array1~0.offset|) (+ (select .cse61 (+ (- 17179869184) .cse63 |c_main_~#array1~0.offset|)) (select .cse61 (+ .cse64 (- 17179869184) |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse60) |c_main_~#array1~0.base|))) (+ (select .cse59 (+ 8 |c_main_~#array1~0.offset|)) (select .cse59 |c_main_~#array1~0.offset|) (select .cse59 (+ |c_main_~#array1~0.offset| 4)) (select .cse60 (+ |c_main_~#array2~0.offset| 4)) (select .cse60 (+ |c_main_~#array2~0.offset| 8)) (select .cse60 |c_main_~#array2~0.offset|) c_main_~sum~0)))) 0) (<= .cse67 (+ 2147483647 .cse66)) (<= (+ .cse66 4294967296) .cse67) (<= (+ .cse58 4294967296) .cse57) (<= aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 2147483647) (< .cse56 (* 8589934593 c_main_~pivot~0)))))) (forall ((aux_div_aux_mod_main_~index~0_63_65 Int) (aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 Int) (aux_div_main_~index~0_63 Int) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (aux_div_aux_mod_aux_mod_main_~index~0_63_65_85 Int)) (let ((.cse83 (* aux_div_aux_mod_main_~index~0_63_65 4294967296)) (.cse82 (* 4294967296 aux_div_aux_mod_aux_mod_main_~index~0_63_65_85))) (let ((.cse71 (+ .cse82 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85)) (.cse70 (* 4294967295 c_main_~pivot~0)) (.cse74 (* 4294967297 c_main_~pivot~0)) (.cse73 (+ .cse82 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse83)) (.cse72 (+ .cse82 (* aux_div_main_~index~0_63 4294967296) aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse83))) (or (< 2147483647 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) (< (+ 2147483647 .cse70) .cse71) (< .cse71 .cse70) (<= (+ (* c_main_~pivot~0 8589934591) c_~ARR_SIZE~0) .cse72) (<= .cse73 (+ 2147483647 .cse74)) (= (let ((.cse78 (* (mod aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 4294967296) 4)) (.cse80 (* (mod (+ aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 c_main_~pivot~0) 4294967296) 4)) (.cse79 (* (mod (+ .cse70 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) 4294967296) 4))) (let ((.cse76 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ |c_main_~#array2~0.offset| .cse78) (let ((.cse81 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse81 (+ .cse80 |c_main_~#array2~0.offset|)) (select .cse81 (+ (- 17179869184) .cse79 |c_main_~#array2~0.offset|))))))) (let ((.cse75 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse77 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse77 (+ .cse78 |c_main_~#array1~0.offset|) (+ (select .cse77 (+ (- 17179869184) .cse79 |c_main_~#array1~0.offset|)) (select .cse77 (+ .cse80 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse76) |c_main_~#array1~0.base|))) (+ (select .cse75 (+ 8 |c_main_~#array1~0.offset|)) (select .cse76 (+ |c_main_~#array2~0.offset| 4)) (select .cse75 (+ |c_main_~#array1~0.offset| 4)) c_main_~sum~0 (select .cse76 (+ |c_main_~#array2~0.offset| 8)) (select .cse75 |c_main_~#array1~0.offset|) (select .cse76 |c_main_~#array2~0.offset|))))) 0) (<= (+ .cse74 4294967296) .cse73) (< aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 0) (< .cse72 (* 8589934593 c_main_~pivot~0)))))) (forall ((aux_div_aux_mod_main_~index~0_63_65 Int) (aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 Int) (aux_div_main_~index~0_63 Int) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (aux_div_aux_mod_aux_mod_main_~index~0_63_65_85 Int)) (let ((.cse97 (* aux_div_aux_mod_main_~index~0_63_65 4294967296)) (.cse96 (* 4294967296 aux_div_aux_mod_aux_mod_main_~index~0_63_65_85))) (let ((.cse91 (* 4294967295 c_main_~pivot~0)) (.cse93 (+ .cse96 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85)) (.cse95 (+ .cse96 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse97)) (.cse94 (* 4294967297 c_main_~pivot~0)) (.cse92 (+ .cse96 (* aux_div_main_~index~0_63 4294967296) aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse97))) (or (= (let ((.cse87 (* (mod aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 4294967296) 4)) (.cse89 (* (mod (+ .cse91 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) 4294967296) 4)) (.cse88 (* (mod (+ aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 c_main_~pivot~0) 4294967296) 4))) (let ((.cse84 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ (- 17179869184) |c_main_~#array2~0.offset| .cse87) (let ((.cse90 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse90 (+ .cse89 |c_main_~#array2~0.offset|)) (select .cse90 (+ .cse88 (- 17179869184) |c_main_~#array2~0.offset|))))))) (let ((.cse85 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse86 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse86 (+ .cse87 |c_main_~#array1~0.offset|) (+ (select .cse86 (+ .cse88 (- 17179869184) |c_main_~#array1~0.offset|)) (select .cse86 (+ .cse89 |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse84) |c_main_~#array1~0.base|))) (+ (select .cse84 (+ |c_main_~#array2~0.offset| 8)) (select .cse84 |c_main_~#array2~0.offset|) (select .cse85 (+ |c_main_~#array1~0.offset| 4)) (select .cse84 (+ |c_main_~#array2~0.offset| 4)) (select .cse85 (+ 8 |c_main_~#array1~0.offset|)) (select .cse85 |c_main_~#array1~0.offset|) c_main_~sum~0)))) 0) (<= 4294967296 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) (<= (+ (* c_main_~pivot~0 8589934591) c_~ARR_SIZE~0) .cse92) (<= .cse93 (+ 2147483647 .cse91)) (<= (+ .cse91 4294967296) .cse93) (<= aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 2147483647) (< (+ 2147483647 .cse94) .cse95) (< .cse95 .cse94) (< .cse92 (* 8589934593 c_main_~pivot~0)))))) (forall ((aux_div_aux_mod_main_~index~0_63_65 Int) (aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 Int) (aux_div_main_~index~0_63 Int) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (aux_div_aux_mod_aux_mod_main_~index~0_63_65_85 Int)) (let ((.cse111 (* aux_div_aux_mod_main_~index~0_63_65 4294967296)) (.cse110 (* 4294967296 aux_div_aux_mod_aux_mod_main_~index~0_63_65_85))) (let ((.cse101 (+ .cse110 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85)) (.cse102 (* 4294967295 c_main_~pivot~0)) (.cse100 (* 4294967297 c_main_~pivot~0)) (.cse99 (+ .cse110 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse111)) (.cse98 (+ .cse110 (* aux_div_main_~index~0_63 4294967296) aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 .cse111))) (or (< 2147483647 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) (<= (+ (* c_main_~pivot~0 8589934591) c_~ARR_SIZE~0) .cse98) (<= .cse99 (+ 2147483647 .cse100)) (<= .cse101 (+ 2147483647 .cse102)) (<= (+ .cse102 4294967296) .cse101) (= (let ((.cse106 (* (mod aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 4294967296) 4)) (.cse108 (* (mod (+ aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 c_main_~pivot~0) 4294967296) 4)) (.cse107 (* (mod (+ .cse102 aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85) 4294967296) 4))) (let ((.cse103 (store (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_277) |c_main_~#array2~0.base|) (+ |c_main_~#array2~0.offset| .cse106) (let ((.cse109 (select (store |c_#memory_int| |c_main_~#array1~0.base| v_ArrVal_278) |c_main_~#array2~0.base|))) (+ (select .cse109 (+ .cse108 (- 17179869184) |c_main_~#array2~0.offset|)) (select .cse109 (+ (- 17179869184) .cse107 |c_main_~#array2~0.offset|))))))) (let ((.cse104 (select (store (store |c_#memory_int| |c_main_~#array1~0.base| (let ((.cse105 (select |c_#memory_int| |c_main_~#array1~0.base|))) (store .cse105 (+ .cse106 |c_main_~#array1~0.offset|) (+ (select .cse105 (+ (- 17179869184) .cse107 |c_main_~#array1~0.offset|)) (select .cse105 (+ .cse108 (- 17179869184) |c_main_~#array1~0.offset|)))))) |c_main_~#array2~0.base| .cse103) |c_main_~#array1~0.base|))) (+ (select .cse103 (+ |c_main_~#array2~0.offset| 4)) (select .cse104 (+ |c_main_~#array1~0.offset| 4)) (select .cse104 |c_main_~#array1~0.offset|) (select .cse104 (+ 8 |c_main_~#array1~0.offset|)) (select .cse103 (+ |c_main_~#array2~0.offset| 8)) c_main_~sum~0 (select .cse103 |c_main_~#array2~0.offset|))))) 0) (<= (+ .cse100 4294967296) .cse99) (< aux_mod_aux_mod_aux_mod_main_~index~0_63_65_85 0) (< .cse98 (* 8589934593 c_main_~pivot~0))))))) is different from true [2022-01-31 10:32:42,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:32:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274543240] [2022-01-31 10:32:42,896 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 10:32:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561354055] [2022-01-31 10:32:42,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561354055] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 10:32:42,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 10:32:42,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-01-31 10:32:42,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597159599] [2022-01-31 10:32:42,897 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 10:32:42,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 10:32:42,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:32:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 10:32:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=665, Unknown=2, NotChecked=106, Total=870 [2022-01-31 10:32:42,898 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 10:32:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:32:43,399 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-01-31 10:32:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 10:32:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2022-01-31 10:32:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:32:43,403 INFO L225 Difference]: With dead ends: 72 [2022-01-31 10:32:43,403 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 10:32:43,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=119, Invalid=879, Unknown=2, NotChecked=122, Total=1122 [2022-01-31 10:32:43,404 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 10:32:43,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 406 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 171 Unchecked, 0.3s Time] [2022-01-31 10:32:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 10:32:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2022-01-31 10:32:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 10:32:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-01-31 10:32:43,410 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 44 [2022-01-31 10:32:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:32:43,411 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-01-31 10:32:43,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 18 states have internal predecessors, (31), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 10:32:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-01-31 10:32:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 10:32:43,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:32:43,412 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:32:43,432 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 10:32:43,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:32:43,616 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:32:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:32:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1673333256, now seen corresponding path program 5 times [2022-01-31 10:32:43,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:32:43,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440133291] [2022-01-31 10:32:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:32:43,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:32:43,639 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 10:32:43,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825976289] [2022-01-31 10:32:43,639 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 10:32:43,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:32:43,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:32:43,641 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 10:32:43,642 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 10:32:43,739 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 10:32:43,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:32:43,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 10:32:43,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:32:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 10:32:43,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:32:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:32:44,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:32:44,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440133291] [2022-01-31 10:32:44,007 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 10:32:44,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825976289] [2022-01-31 10:32:44,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825976289] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:32:44,008 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:32:44,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 10:32:44,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902479926] [2022-01-31 10:32:44,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:32:44,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 10:32:44,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:32:44,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 10:32:44,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 10:32:44,009 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 10:32:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:32:44,163 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-01-31 10:32:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 10:32:44,164 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2022-01-31 10:32:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:32:44,165 INFO L225 Difference]: With dead ends: 87 [2022-01-31 10:32:44,165 INFO L226 Difference]: Without dead ends: 79 [2022-01-31 10:32:44,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 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 10:32:44,166 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 49 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:32:44,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 168 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:32:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-31 10:32:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-01-31 10:32:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 10:32:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-01-31 10:32:44,172 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 46 [2022-01-31 10:32:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:32:44,172 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-01-31 10:32:44,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 10:32:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-01-31 10:32:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 10:32:44,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:32:44,173 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:32:44,192 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 10:32:44,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:32:44,380 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:32:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:32:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2064602094, now seen corresponding path program 6 times [2022-01-31 10:32:44,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:32:44,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255226053] [2022-01-31 10:32:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:32:44,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:32:44,393 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 10:32:44,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150335192] [2022-01-31 10:32:44,393 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 10:32:44,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:32:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:32:44,399 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 10:32:44,405 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 10:32:44,774 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 10:32:44,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 10:32:44,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 10:32:44,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:32:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 10:32:44,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 10:32:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 10:32:45,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 10:32:45,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255226053] [2022-01-31 10:32:45,066 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 10:32:45,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150335192] [2022-01-31 10:32:45,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150335192] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 10:32:45,066 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 10:32:45,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-31 10:32:45,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795921618] [2022-01-31 10:32:45,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 10:32:45,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 10:32:45,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 10:32:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 10:32:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-31 10:32:45,068 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 10:32:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 10:32:45,263 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-01-31 10:32:45,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 10:32:45,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2022-01-31 10:32:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 10:32:45,264 INFO L225 Difference]: With dead ends: 77 [2022-01-31 10:32:45,264 INFO L226 Difference]: Without dead ends: 77 [2022-01-31 10:32:45,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 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 10:32:45,265 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 10:32:45,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 169 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 10:32:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-31 10:32:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-01-31 10:32:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 10:32:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-01-31 10:32:45,271 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 46 [2022-01-31 10:32:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 10:32:45,271 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-01-31 10:32:45,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 10:32:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-01-31 10:32:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 10:32:45,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 10:32:45,273 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 10:32:45,279 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 10:32:45,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:32:45,480 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 10:32:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 10:32:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1099891118, now seen corresponding path program 7 times [2022-01-31 10:32:45,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 10:32:45,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158627213] [2022-01-31 10:32:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 10:32:45,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 10:32:45,496 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 10:32:45,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686086979] [2022-01-31 10:32:45,496 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 10:32:45,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 10:32:45,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 10:32:45,500 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 10:32:45,501 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 10:32:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 10:32:46,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 104 conjunts are in the unsatisfiable core [2022-01-31 10:32:46,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 10:32:46,437 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 10:32:46,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-01-31 10:32:46,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 15 [2022-01-31 10:32:46,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-01-31 10:32:46,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2022-01-31 10:32:46,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:32:46,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:32:46,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:32:46,748 INFO L353 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2022-01-31 10:32:46,749 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 7 case distinctions, treesize of input 122 treesize of output 112 [2022-01-31 10:32:46,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:32:46,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:32:46,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:32:46,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:46,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 10:32:46,944 INFO L353 Elim1Store]: treesize reduction 47, result has 19.0 percent of original size [2022-01-31 10:32:46,944 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 6 new quantified variables, introduced 16 case distinctions, treesize of input 134 treesize of output 135 [2022-01-31 10:32:48,285 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-31 10:32:48,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1111 treesize of output 1028 [2022-01-31 10:32:48,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,431 INFO L244 Elim1Store]: Index analysis took 125 ms [2022-01-31 10:32:48,471 INFO L353 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-01-31 10:32:48,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 39 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 447 treesize of output 499 [2022-01-31 10:32:48,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 94 [2022-01-31 10:32:48,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 386 treesize of output 294 [2022-01-31 10:32:48,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:32:48,694 INFO L244 Elim1Store]: Index analysis took 114 ms [2022-01-31 10:32:48,725 INFO L353 Elim1Store]: treesize reduction 152, result has 0.7 percent of original size [2022-01-31 10:32:48,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 39 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 580 treesize of output 448 [2022-01-31 10:32:48,908 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-31 10:32:48,960 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 19 treesize of output 11 [2022-01-31 10:32:49,012 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 20 treesize of output 11 [2022-01-31 10:33:04,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:33:04,344 INFO L244 Elim1Store]: Index analysis took 126 ms [2022-01-31 10:33:04,448 INFO L353 Elim1Store]: treesize reduction 42, result has 40.8 percent of original size [2022-01-31 10:33:04,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 32 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 4 case distinctions, treesize of input 164 treesize of output 119 [2022-01-31 10:34:47,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:34:47,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:34:47,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:34:47,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:34:47,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:34:47,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 10:34:57,906 WARN L228 SmtUtils]: Spent 10.72s on a formula simplification. DAG size of input: 295 DAG size of output: 123 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-31 10:34:57,906 INFO L353 Elim1Store]: treesize reduction 1050, result has 23.1 percent of original size [2022-01-31 10:34:57,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 60 case distinctions, treesize of input 702 treesize of output 910