/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/brs2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 00:47:47,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 00:47:47,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 00:47:47,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 00:47:47,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 00:47:47,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 00:47:47,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 00:47:47,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 00:47:48,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 00:47:48,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 00:47:48,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 00:47:48,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 00:47:48,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 00:47:48,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 00:47:48,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 00:47:48,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 00:47:48,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 00:47:48,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 00:47:48,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 00:47:48,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 00:47:48,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 00:47:48,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 00:47:48,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 00:47:48,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 00:47:48,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 00:47:48,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 00:47:48,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 00:47:48,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 00:47:48,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 00:47:48,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 00:47:48,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 00:47:48,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 00:47:48,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 00:47:48,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 00:47:48,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 00:47:48,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 00:47:48,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 00:47:48,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 00:47:48,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 00:47:48,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 00:47:48,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 00:47:48,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 00:47:48,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 00:47:48,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 00:47:48,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 00:47:48,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 00:47:48,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 00:47:48,076 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 00:47:48,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 00:47:48,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 00:47:48,077 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 00:47:48,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 00:47:48,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 00:47:48,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 00:47:48,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 00:47:48,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 00:47:48,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 00:47:48,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 00:47:48,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 00:47:48,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 00:47:48,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 00:47:48,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 00:47:48,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 00:47:48,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 00:47:48,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 00:47:48,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 00:47:48,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 00:47:48,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 00:47:48,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 00:47:48,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 00:47:48,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 00:47:48,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 00:47:48,080 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 00:47:48,080 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 00:47:48,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 00:47:48,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 00:47:48,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 00:47:48,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 00:47:48,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 00:47:48,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 00:47:48,312 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 00:47:48,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs2.c [2022-01-31 00:47:48,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31cf3877/202bb3d9f86640bb912177683c0f0975/FLAG036ef54f1 [2022-01-31 00:47:48,773 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 00:47:48,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c [2022-01-31 00:47:48,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31cf3877/202bb3d9f86640bb912177683c0f0975/FLAG036ef54f1 [2022-01-31 00:47:48,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31cf3877/202bb3d9f86640bb912177683c0f0975 [2022-01-31 00:47:48,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 00:47:48,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 00:47:48,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 00:47:48,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 00:47:48,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 00:47:48,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:48,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2e56fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48, skipping insertion in model container [2022-01-31 00:47:48,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:48,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 00:47:48,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 00:47:48,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c[587,600] [2022-01-31 00:47:48,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 00:47:48,960 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 00:47:48,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs2.c[587,600] [2022-01-31 00:47:48,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 00:47:48,985 INFO L208 MainTranslator]: Completed translation [2022-01-31 00:47:48,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48 WrapperNode [2022-01-31 00:47:48,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 00:47:48,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 00:47:48,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 00:47:48,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 00:47:48,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:48,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:49,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:49,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:49,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:49,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:49,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:49,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 00:47:49,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 00:47:49,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 00:47:49,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 00:47:49,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (1/1) ... [2022-01-31 00:47:49,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 00:47:49,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:47:49,052 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 00:47:49,064 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 00:47:49,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 00:47:49,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 00:47:49,092 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 00:47:49,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 00:47:49,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 00:47:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 00:47:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 00:47:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 00:47:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 00:47:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 00:47:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 00:47:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 00:47:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 00:47:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 00:47:49,150 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 00:47:49,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 00:47:49,321 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 00:47:49,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 00:47:49,326 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 00:47:49,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:47:49 BoogieIcfgContainer [2022-01-31 00:47:49,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 00:47:49,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 00:47:49,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 00:47:49,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 00:47:49,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:47:48" (1/3) ... [2022-01-31 00:47:49,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cb8f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:47:49, skipping insertion in model container [2022-01-31 00:47:49,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:47:48" (2/3) ... [2022-01-31 00:47:49,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cb8f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:47:49, skipping insertion in model container [2022-01-31 00:47:49,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:47:49" (3/3) ... [2022-01-31 00:47:49,351 INFO L111 eAbstractionObserver]: Analyzing ICFG brs2.c [2022-01-31 00:47:49,355 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 00:47:49,355 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 00:47:49,426 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 00:47:49,432 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 00:47:49,432 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 00:47:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:47:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 00:47:49,480 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:47:49,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:47:49,481 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:47:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:47:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash 816154861, now seen corresponding path program 1 times [2022-01-31 00:47:49,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:47:49,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368480558] [2022-01-31 00:47:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:49,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:47:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:47:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:47:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:49,724 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 00:47:49,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:47:49,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368480558] [2022-01-31 00:47:49,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368480558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 00:47:49,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 00:47:49,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 00:47:49,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585439684] [2022-01-31 00:47:49,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 00:47:49,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 00:47:49,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:47:49,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 00:47:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 00:47:49,756 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:47:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:47:49,830 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-01-31 00:47:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 00:47:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-01-31 00:47:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:47:49,841 INFO L225 Difference]: With dead ends: 56 [2022-01-31 00:47:49,842 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 00:47:49,845 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 00:47:49,849 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:47:49,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:47:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 00:47:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 00:47:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-01-31 00:47:49,893 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2022-01-31 00:47:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:47:49,894 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-01-31 00:47:49,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:47:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-01-31 00:47:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 00:47:49,896 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:47:49,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:47:49,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 00:47:49,897 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:47:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:47:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1231644863, now seen corresponding path program 1 times [2022-01-31 00:47:49,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:47:49,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308649176] [2022-01-31 00:47:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:49,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:47:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:47:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:47:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,046 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 00:47:50,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:47:50,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308649176] [2022-01-31 00:47:50,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308649176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 00:47:50,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 00:47:50,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 00:47:50,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787661830] [2022-01-31 00:47:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 00:47:50,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 00:47:50,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:47:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 00:47:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 00:47:50,050 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:47:50,150 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-01-31 00:47:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 00:47:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-01-31 00:47:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:47:50,151 INFO L225 Difference]: With dead ends: 45 [2022-01-31 00:47:50,152 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 00:47:50,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 00:47:50,157 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:47:50,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 30 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:47:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 00:47:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-01-31 00:47:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-01-31 00:47:50,179 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2022-01-31 00:47:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:47:50,179 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-01-31 00:47:50,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-01-31 00:47:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 00:47:50,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:47:50,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:47:50,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 00:47:50,181 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:47:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:47:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1305126266, now seen corresponding path program 1 times [2022-01-31 00:47:50,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:47:50,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263404617] [2022-01-31 00:47:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:50,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:47:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:47:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:47:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 00:47:50,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:47:50,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263404617] [2022-01-31 00:47:50,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263404617] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 00:47:50,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 00:47:50,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 00:47:50,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189700481] [2022-01-31 00:47:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 00:47:50,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 00:47:50,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:47:50,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 00:47:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 00:47:50,368 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:50,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:47:50,500 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-01-31 00:47:50,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 00:47:50,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-01-31 00:47:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:47:50,502 INFO L225 Difference]: With dead ends: 39 [2022-01-31 00:47:50,502 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 00:47:50,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 00:47:50,503 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:47:50,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:47:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 00:47:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-31 00:47:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-01-31 00:47:50,509 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2022-01-31 00:47:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:47:50,509 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-01-31 00:47:50,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-01-31 00:47:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 00:47:50,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:47:50,511 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:47:50,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 00:47:50,511 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:47:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:47:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash -455123849, now seen corresponding path program 1 times [2022-01-31 00:47:50,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:47:50,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107094998] [2022-01-31 00:47:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:50,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:47:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:47:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:47:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:50,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:47:50,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107094998] [2022-01-31 00:47:50,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107094998] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:47:50,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154287204] [2022-01-31 00:47:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:50,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:47:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:47:50,595 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 00:47:50,601 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 00:47:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:50,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 00:47:50,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:47:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:50,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:47:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:50,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154287204] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:47:50,906 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:47:50,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 00:47:50,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718964735] [2022-01-31 00:47:50,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:47:50,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 00:47:50,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:47:50,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 00:47:50,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 00:47:50,910 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:47:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:47:51,107 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-01-31 00:47:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 00:47:51,108 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-01-31 00:47:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:47:51,108 INFO L225 Difference]: With dead ends: 55 [2022-01-31 00:47:51,108 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 00:47:51,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 00:47:51,110 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:47:51,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 44 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:47:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 00:47:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-01-31 00:47:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-31 00:47:51,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 30 [2022-01-31 00:47:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:47:51,116 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-31 00:47:51,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:47:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-31 00:47:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 00:47:51,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:47:51,117 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:47:51,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 00:47:51,343 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 00:47:51,344 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:47:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:47:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 702007325, now seen corresponding path program 1 times [2022-01-31 00:47:51,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:47:51,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099098264] [2022-01-31 00:47:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:51,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:47:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:47:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:51,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:47:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:51,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:47:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099098264] [2022-01-31 00:47:51,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099098264] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:47:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044482620] [2022-01-31 00:47:51,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:51,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:47:51,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:47:51,770 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 00:47:51,791 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 00:47:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:51,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 00:47:51,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:47:51,902 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 00:47:51,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-01-31 00:47:52,085 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 29 treesize of output 28 [2022-01-31 00:47:52,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-01-31 00:47:52,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-01-31 00:47:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:52,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:47:53,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_72 Int)) (or (not (<= v_ArrVal_72 0)) (<= (+ (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |main_~#sum~0.offset| v_ArrVal_72)) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) v_ArrVal_72) (* c_~N~0 2)))) is different from false [2022-01-31 00:47:55,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_72 Int)) (or (<= (+ v_ArrVal_72 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |main_~#sum~0.offset| v_ArrVal_72)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) (* c_~N~0 2)) (not (<= v_ArrVal_72 0)))) is different from false [2022-01-31 00:47:55,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2022-01-31 00:47:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-31 00:47:55,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044482620] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:47:55,669 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:47:55,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 32 [2022-01-31 00:47:55,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388987680] [2022-01-31 00:47:55,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:47:55,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 00:47:55,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:47:55,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 00:47:55,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=753, Unknown=2, NotChecked=114, Total=992 [2022-01-31 00:47:55,672 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:47:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:47:56,169 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-01-31 00:47:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 00:47:56,170 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-01-31 00:47:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:47:56,170 INFO L225 Difference]: With dead ends: 70 [2022-01-31 00:47:56,171 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 00:47:56,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=216, Invalid=1272, Unknown=2, NotChecked=150, Total=1640 [2022-01-31 00:47:56,172 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 00:47:56,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 153 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 506 Invalid, 0 Unknown, 85 Unchecked, 0.3s Time] [2022-01-31 00:47:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 00:47:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-01-31 00:47:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-01-31 00:47:56,178 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 33 [2022-01-31 00:47:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:47:56,178 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-01-31 00:47:56,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:47:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-01-31 00:47:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 00:47:56,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:47:56,180 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:47:56,203 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 00:47:56,380 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 00:47:56,381 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:47:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:47:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2123296012, now seen corresponding path program 2 times [2022-01-31 00:47:56,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:47:56,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708576287] [2022-01-31 00:47:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:56,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:47:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:56,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:47:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:56,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:47:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:56,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:47:56,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708576287] [2022-01-31 00:47:56,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708576287] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:47:56,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263950658] [2022-01-31 00:47:56,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:47:56,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:47:56,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:47:56,465 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 00:47:56,467 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 00:47:56,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:47:56,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:47:56,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 00:47:56,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:47:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:56,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:47:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:56,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263950658] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:47:56,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:47:56,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 00:47:56,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205883195] [2022-01-31 00:47:56,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:47:56,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 00:47:56,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:47:56,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 00:47:56,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 00:47:56,726 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:47:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:47:56,933 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-01-31 00:47:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 00:47:56,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 00:47:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:47:56,935 INFO L225 Difference]: With dead ends: 82 [2022-01-31 00:47:56,935 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 00:47:56,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 00:47:56,936 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:47:56,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 00:47:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 00:47:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-01-31 00:47:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:47:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-01-31 00:47:56,941 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 36 [2022-01-31 00:47:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:47:56,941 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-01-31 00:47:56,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:47:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-01-31 00:47:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 00:47:56,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:47:56,942 INFO L514 BasicCegarLoop]: trace histogram [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 00:47:56,979 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 00:47:57,176 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 00:47:57,177 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:47:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:47:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash 421717656, now seen corresponding path program 3 times [2022-01-31 00:47:57,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:47:57,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393556325] [2022-01-31 00:47:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:47:57,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:47:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:47:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:47:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:47:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:47:57,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:47:57,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393556325] [2022-01-31 00:47:57,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393556325] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:47:57,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100399744] [2022-01-31 00:47:57,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 00:47:57,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:47:57,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:47:57,771 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 00:47:57,795 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 00:47:57,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 00:47:57,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:47:57,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-31 00:47:57,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:47:57,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 00:47:57,987 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 00:47:57,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-01-31 00:47:58,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:47:58,204 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-31 00:47:58,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 00:47:58,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:47:58,351 INFO L353 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-01-31 00:47:58,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 56 [2022-01-31 00:47:58,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:47:58,586 INFO L353 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-01-31 00:47:58,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 68 [2022-01-31 00:48:03,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:03,252 INFO L353 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-01-31 00:48:03,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 21 [2022-01-31 00:48:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:48:03,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:48:25,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_145 Int) (v_ArrVal_143 Int) (~N~0 Int) (v_ArrVal_141 Int) (v_main_~i~0_50 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) v_ArrVal_141)))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|)) (.cse2 (* v_main_~i~0_50 4))) (or (not (<= v_ArrVal_141 2)) (not (<= v_ArrVal_145 (+ v_ArrVal_143 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_143)) c_main_~a~0.base) (+ c_main_~a~0.offset .cse2))))) (<= (+ v_ArrVal_145 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_145)) c_main_~a~0.base) (+ c_main_~a~0.offset .cse2 4))) (* 2 ~N~0)) (< (+ v_main_~i~0_50 2) ~N~0) (not (< (+ v_main_~i~0_50 1) ~N~0)) (< v_main_~i~0_50 1) (not (<= v_ArrVal_143 0)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0))))) is different from false [2022-01-31 00:48:25,297 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-31 00:48:25,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1628 treesize of output 1 [2022-01-31 00:48:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-01-31 00:48:25,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100399744] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:48:25,322 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:48:25,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 56 [2022-01-31 00:48:25,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927586475] [2022-01-31 00:48:25,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:48:25,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-31 00:48:25,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:48:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-31 00:48:25,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2623, Unknown=11, NotChecked=106, Total=3080 [2022-01-31 00:48:25,326 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 56 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:48:26,428 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (let ((.cse0 (select (select |c_#memory_int| c_main_~a~0.base) .cse1))) (and (= .cse0 0) (<= c_main_~i~0 1) (or (<= (+ c_main_~i~0 1) c_~N~0) (<= (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 4) (* c_~N~0 2))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (< 3 .cse1) (<= .cse0 0) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_145 Int) (v_ArrVal_143 Int) (~N~0 Int) (v_ArrVal_141 Int) (v_main_~i~0_50 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) v_ArrVal_141)))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|)) (.cse4 (* v_main_~i~0_50 4))) (or (not (<= v_ArrVal_141 2)) (not (<= v_ArrVal_145 (+ v_ArrVal_143 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |main_~#sum~0.offset| v_ArrVal_143)) c_main_~a~0.base) (+ c_main_~a~0.offset .cse4))))) (<= (+ v_ArrVal_145 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |main_~#sum~0.offset| v_ArrVal_145)) c_main_~a~0.base) (+ c_main_~a~0.offset .cse4 4))) (* 2 ~N~0)) (< (+ v_main_~i~0_50 2) ~N~0) (not (< (+ v_main_~i~0_50 1) ~N~0)) (< v_main_~i~0_50 1) (not (<= v_ArrVal_143 0)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 00:48:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:48:42,129 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2022-01-31 00:48:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 00:48:42,129 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 00:48:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:48:42,132 INFO L225 Difference]: With dead ends: 124 [2022-01-31 00:48:42,132 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 00:48:42,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=708, Invalid=5288, Unknown=18, NotChecked=306, Total=6320 [2022-01-31 00:48:42,135 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:48:42,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 151 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 276 Invalid, 0 Unknown, 294 Unchecked, 0.2s Time] [2022-01-31 00:48:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 00:48:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-01-31 00:48:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:48:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2022-01-31 00:48:42,148 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 39 [2022-01-31 00:48:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:48:42,148 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2022-01-31 00:48:42,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 states have internal predecessors, (80), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:48:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-01-31 00:48:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 00:48:42,150 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:48:42,150 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:48:42,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-31 00:48:42,364 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 00:48:42,364 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:48:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:48:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash -133775244, now seen corresponding path program 4 times [2022-01-31 00:48:42,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:48:42,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966807020] [2022-01-31 00:48:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:48:42,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:48:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:48:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:42,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:48:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:48:42,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:48:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966807020] [2022-01-31 00:48:42,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966807020] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:48:42,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732396891] [2022-01-31 00:48:42,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 00:48:42,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:48:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:48:42,500 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 00:48:42,504 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 00:48:42,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 00:48:42,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:48:42,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 00:48:42,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:48:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:48:42,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:48:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:48:42,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732396891] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:48:42,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:48:42,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 00:48:42,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959180872] [2022-01-31 00:48:42,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:48:42,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 00:48:42,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:48:42,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 00:48:42,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 00:48:42,826 INFO L87 Difference]: Start difference. First operand 84 states and 97 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:48:43,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:48:43,102 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-01-31 00:48:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 00:48:43,103 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 00:48:43,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:48:43,104 INFO L225 Difference]: With dead ends: 101 [2022-01-31 00:48:43,104 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 00:48:43,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 00:48:43,105 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:48:43,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 73 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 00:48:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 00:48:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 52. [2022-01-31 00:48:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:48:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-01-31 00:48:43,116 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 42 [2022-01-31 00:48:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:48:43,116 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-01-31 00:48:43,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:48:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-01-31 00:48:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 00:48:43,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:48:43,118 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:48:43,146 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 00:48:43,331 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 00:48:43,332 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:48:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:48:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash -371696904, now seen corresponding path program 5 times [2022-01-31 00:48:43,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:48:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434510993] [2022-01-31 00:48:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:48:43,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:48:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:48:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:48:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:48:43,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:48:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434510993] [2022-01-31 00:48:43,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434510993] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:48:43,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849150535] [2022-01-31 00:48:43,473 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 00:48:43,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:48:43,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:48:43,474 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 00:48:43,476 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 00:48:43,550 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 00:48:43,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:48:43,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 00:48:43,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:48:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:48:43,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:48:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:48:43,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849150535] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:48:43,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:48:43,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-01-31 00:48:43,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695599911] [2022-01-31 00:48:43,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:48:43,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 00:48:43,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:48:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 00:48:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2022-01-31 00:48:43,877 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:48:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:48:44,215 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-01-31 00:48:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 00:48:44,215 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-01-31 00:48:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:48:44,216 INFO L225 Difference]: With dead ends: 112 [2022-01-31 00:48:44,216 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 00:48:44,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 00:48:44,218 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 116 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:48:44,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 51 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 00:48:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 00:48:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2022-01-31 00:48:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:48:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-01-31 00:48:44,229 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 45 [2022-01-31 00:48:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:48:44,229 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-01-31 00:48:44,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 22 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:48:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-01-31 00:48:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 00:48:44,230 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:48:44,230 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:48:44,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 00:48:44,443 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 00:48:44,444 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:48:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:48:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1517427835, now seen corresponding path program 6 times [2022-01-31 00:48:44,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:48:44,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745948381] [2022-01-31 00:48:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:48:44,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:48:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:45,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:48:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:45,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:48:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:48:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:48:45,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:48:45,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745948381] [2022-01-31 00:48:45,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745948381] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:48:45,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774039830] [2022-01-31 00:48:45,497 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 00:48:45,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:48:45,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:48: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 00:48:45,508 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 00:48:45,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 00:48:45,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:48:45,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-31 00:48:45,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:48:45,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 00:48:45,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:45,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-01-31 00:48:45,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:45,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:45,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 00:48:46,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-31 00:48:46,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:48:46,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2022-01-31 00:48:46,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:48:46,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2022-01-31 00:48:46,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 00:48:46,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:48:46,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2022-01-31 00:48:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:48:46,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:49:00,976 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_281 Int)) (let ((.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_281 (let ((.cse0 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| 0)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse0 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| .cse0)) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))) (<= (div (+ (* (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_281)) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) (* v_ArrVal_281 (- 1))) (- 2)) 3)))) is different from false [2022-01-31 00:49:15,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_275 Int) (v_ArrVal_281 Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) v_ArrVal_275)))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_275 0)) (not (<= v_ArrVal_281 (let ((.cse0 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| 0)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse0 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| .cse0)) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))) (<= (div (+ (* (- 1) (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |main_~#sum~0.offset| v_ArrVal_281)) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) (* v_ArrVal_281 (- 1))) (- 2)) 3))))) is different from false [2022-01-31 00:49:36,511 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_275 Int) (v_ArrVal_274 Int) (v_ArrVal_281 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset 4) v_ArrVal_274) (+ .cse3 c_main_~a~0.offset 8) v_ArrVal_275))))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_275 0)) (not (<= v_ArrVal_274 2)) (<= (div (+ (* v_ArrVal_281 (- 1)) (* (- 1) (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_281)) c_main_~a~0.base) (+ c_main_~a~0.offset 12)))) (- 2)) 3) (not (<= v_ArrVal_281 (let ((.cse2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| 0)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| .cse2)) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse2)))))))) is different from false [2022-01-31 00:49:36,550 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-01-31 00:49:36,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59768 treesize of output 58220 [2022-01-31 00:49:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 32 refuted. 2 times theorem prover too weak. 0 trivial. 10 not checked. [2022-01-31 00:49:38,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774039830] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:49:38,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:49:38,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 58 [2022-01-31 00:49:38,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097935536] [2022-01-31 00:49:38,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:49:38,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 00:49:38,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:49:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 00:49:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2697, Unknown=20, NotChecked=324, Total=3306 [2022-01-31 00:49:38,684 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 58 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 55 states have internal predecessors, (99), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:50:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:50:20,311 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2022-01-31 00:50:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-31 00:50:20,312 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 55 states have internal predecessors, (99), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-01-31 00:50:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:50:20,313 INFO L225 Difference]: With dead ends: 166 [2022-01-31 00:50:20,313 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 00:50:20,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 91.4s TimeCoverageRelationStatistics Valid=623, Invalid=6662, Unknown=37, NotChecked=510, Total=7832 [2022-01-31 00:50:20,316 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 623 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 00:50:20,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 203 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 659 Invalid, 0 Unknown, 623 Unchecked, 0.4s Time] [2022-01-31 00:50:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 00:50:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-01-31 00:50:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 73 states have internal predecessors, (82), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:50:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-01-31 00:50:20,340 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 45 [2022-01-31 00:50:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:50:20,340 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-01-31 00:50:20,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 55 states have internal predecessors, (99), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:50:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-01-31 00:50:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 00:50:20,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:50:20,346 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:50:20,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 00:50:20,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:50:20,552 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:50:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:50:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash -595638757, now seen corresponding path program 7 times [2022-01-31 00:50:20,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:50:20,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340128392] [2022-01-31 00:50:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:50:20,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:50:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:50:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:50:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:50:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:50:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:50:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:50:20,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:50:20,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340128392] [2022-01-31 00:50:20,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340128392] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:50:20,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014124947] [2022-01-31 00:50:20,711 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 00:50:20,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:50:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:50:20,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:50:20,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 00:50:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:50:20,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 00:50:20,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:50:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:50:20,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:50:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:50:21,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014124947] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:50:21,071 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:50:21,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 00:50:21,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647904047] [2022-01-31 00:50:21,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:50:21,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 00:50:21,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:50:21,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 00:50:21,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 00:50:21,073 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:50:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:50:21,347 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-01-31 00:50:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 00:50:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-01-31 00:50:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:50:21,348 INFO L225 Difference]: With dead ends: 99 [2022-01-31 00:50:21,348 INFO L226 Difference]: Without dead ends: 79 [2022-01-31 00:50:21,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 00:50:21,349 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 63 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:50:21,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 75 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 00:50:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-31 00:50:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2022-01-31 00:50:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 00:50:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-01-31 00:50:21,365 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 48 [2022-01-31 00:50:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:50:21,365 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-01-31 00:50:21,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:50:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-01-31 00:50:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 00:50:21,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:50:21,366 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:50:21,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 00:50:21,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-31 00:50:21,567 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:50:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:50:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1297093578, now seen corresponding path program 8 times [2022-01-31 00:50:21,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:50:21,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635381529] [2022-01-31 00:50:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:50:21,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:50:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:50:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:50:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:50:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:50:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:50:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:50:22,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:50:22,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635381529] [2022-01-31 00:50:22,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635381529] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:50:22,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545598767] [2022-01-31 00:50:22,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:50:22,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:50:22,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:50:22,731 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:50:22,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 00:50:22,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:50:22,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:50:22,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-31 00:50:22,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:50:22,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 00:50:23,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 00:50:23,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,153 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 37 treesize of output 39 [2022-01-31 00:50:23,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,283 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 41 treesize of output 46 [2022-01-31 00:50:23,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-01-31 00:50:23,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:50:23,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2022-01-31 00:50:23,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:23,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:50:23,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2022-01-31 00:50:24,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:50:24,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2022-01-31 00:50:24,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2022-01-31 00:50:24,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:50:24,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-01-31 00:50:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:50:24,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:51:13,460 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_389 Int) (v_ArrVal_388 Int) (v_ArrVal_385 Int) (v_ArrVal_395 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_385) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_388))))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_391 (+ v_ArrVal_389 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_389)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (not (<= v_ArrVal_389 0)) (not (<= v_ArrVal_395 (+ v_ArrVal_393 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_393)) c_main_~a~0.base) (+ c_main_~a~0.offset 12))))) (not (<= v_ArrVal_385 0)) (not (<= v_ArrVal_393 (+ v_ArrVal_391 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_391)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (not (<= v_ArrVal_388 2)) (<= (+ v_ArrVal_395 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_395)) c_main_~a~0.base) (+ c_main_~a~0.offset 16))) (* c_~N~0 2)))))) is different from false [2022-01-31 00:51:40,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_389 Int) (v_ArrVal_388 Int) (v_ArrVal_385 Int) (v_ArrVal_395 Int) (v_ArrVal_383 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_383) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_385) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_388))))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_383 2)) (<= (+ v_ArrVal_395 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_395)) c_main_~a~0.base) (+ c_main_~a~0.offset 16))) (* c_~N~0 2)) (not (<= v_ArrVal_389 0)) (not (<= v_ArrVal_395 (+ v_ArrVal_393 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_393)) c_main_~a~0.base) (+ c_main_~a~0.offset 12))))) (not (<= v_ArrVal_385 0)) (not (<= v_ArrVal_391 (+ (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_389)) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) v_ArrVal_389))) (not (<= v_ArrVal_388 2)) (not (<= v_ArrVal_393 (+ v_ArrVal_391 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_391)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))))))) is different from false [2022-01-31 00:51:45,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_389 Int) (v_ArrVal_388 Int) (v_ArrVal_385 Int) (v_ArrVal_395 Int) (v_ArrVal_383 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base (let ((.cse2 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset 4) v_ArrVal_383) (+ .cse2 c_main_~a~0.offset 8) v_ArrVal_385) (+ .cse2 c_main_~a~0.offset 12) v_ArrVal_388))))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= v_ArrVal_383 2)) (not (<= v_ArrVal_393 (+ v_ArrVal_391 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_391)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) (not (<= v_ArrVal_389 0)) (not (<= v_ArrVal_395 (+ v_ArrVal_393 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_393)) c_main_~a~0.base) (+ c_main_~a~0.offset 12))))) (not (<= v_ArrVal_385 0)) (not (<= v_ArrVal_388 2)) (not (<= v_ArrVal_391 (+ v_ArrVal_389 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_389)) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) (<= (+ v_ArrVal_395 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| v_ArrVal_395)) c_main_~a~0.base) (+ c_main_~a~0.offset 16))) (* c_~N~0 2)))))) is different from false [2022-01-31 00:51:45,075 INFO L353 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-01-31 00:51:45,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78774 treesize of output 78282 [2022-01-31 00:52:10,155 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 00:52:10,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-31 00:52:10,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:52:10,357 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-31 00:52:10,359 INFO L158 Benchmark]: Toolchain (without parser) took 261554.72ms. Allocated memory was 177.2MB in the beginning and 604.0MB in the end (delta: 426.8MB). Free memory was 126.4MB in the beginning and 511.3MB in the end (delta: -384.9MB). Peak memory consumption was 287.0MB. Max. memory is 8.0GB. [2022-01-31 00:52:10,359 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 00:52:10,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.42ms. Allocated memory is still 177.2MB. Free memory was 126.2MB in the beginning and 151.9MB in the end (delta: -25.7MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-01-31 00:52:10,359 INFO L158 Benchmark]: Boogie Preprocessor took 25.18ms. Allocated memory is still 177.2MB. Free memory was 151.9MB in the beginning and 150.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 00:52:10,359 INFO L158 Benchmark]: RCFGBuilder took 313.92ms. Allocated memory is still 177.2MB. Free memory was 150.4MB in the beginning and 138.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 00:52:10,360 INFO L158 Benchmark]: TraceAbstraction took 261029.60ms. Allocated memory was 177.2MB in the beginning and 604.0MB in the end (delta: 426.8MB). Free memory was 138.3MB in the beginning and 511.3MB in the end (delta: -373.0MB). Peak memory consumption was 298.3MB. Max. memory is 8.0GB. [2022-01-31 00:52:10,361 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.42ms. Allocated memory is still 177.2MB. Free memory was 126.2MB in the beginning and 151.9MB in the end (delta: -25.7MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.18ms. Allocated memory is still 177.2MB. Free memory was 151.9MB in the beginning and 150.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.92ms. Allocated memory is still 177.2MB. Free memory was 150.4MB in the beginning and 138.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 261029.60ms. Allocated memory was 177.2MB in the beginning and 604.0MB in the end (delta: 426.8MB). Free memory was 138.3MB in the beginning and 511.3MB in the end (delta: -373.0MB). Peak memory consumption was 298.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-31 00:52:10,570 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-31 00:52:10,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...