/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/s1if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 01:25:58,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 01:25:58,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 01:25:58,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 01:25:58,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 01:25:58,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 01:25:58,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 01:25:58,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 01:25:58,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 01:25:58,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 01:25:58,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 01:25:58,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 01:25:58,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 01:25:58,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 01:25:58,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 01:25:58,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 01:25:58,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 01:25:58,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 01:25:58,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 01:25:58,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 01:25:58,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 01:25:58,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 01:25:58,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 01:25:58,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 01:25:58,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 01:25:58,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 01:25:58,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 01:25:58,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 01:25:58,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 01:25:58,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 01:25:58,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 01:25:58,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 01:25:58,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 01:25:58,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 01:25:58,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 01:25:58,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 01:25:58,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 01:25:58,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 01:25:58,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 01:25:58,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 01:25:58,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 01:25:58,123 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 01:25:58,143 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 01:25:58,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 01:25:58,144 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 01:25:58,144 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 01:25:58,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 01:25:58,145 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 01:25:58,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 01:25:58,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 01:25:58,146 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 01:25:58,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 01:25:58,146 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 01:25:58,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 01:25:58,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 01:25:58,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 01:25:58,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 01:25:58,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 01:25:58,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 01:25:58,147 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 01:25:58,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 01:25:58,148 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 01:25:58,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 01:25:58,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 01:25:58,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 01:25:58,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 01:25:58,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:25:58,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 01:25:58,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 01:25:58,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 01:25:58,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 01:25:58,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 01:25:58,150 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 01:25:58,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 01:25:58,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 01:25:58,150 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 01:25:58,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 01:25:58,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 01:25:58,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 01:25:58,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 01:25:58,407 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 01:25:58,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s1if.c [2022-01-31 01:25:58,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c86fb4c3/5bff25d612054e59aa7a0ddcaae8924e/FLAG384e20b39 [2022-01-31 01:25:58,888 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 01:25:58,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s1if.c [2022-01-31 01:25:58,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c86fb4c3/5bff25d612054e59aa7a0ddcaae8924e/FLAG384e20b39 [2022-01-31 01:25:58,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c86fb4c3/5bff25d612054e59aa7a0ddcaae8924e [2022-01-31 01:25:58,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 01:25:58,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 01:25:58,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 01:25:58,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 01:25:58,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 01:25:58,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:25:58" (1/1) ... [2022-01-31 01:25:58,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62887194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:58, skipping insertion in model container [2022-01-31 01:25:58,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:25:58" (1/1) ... [2022-01-31 01:25:58,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 01:25:58,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 01:25:59,132 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/s1if.c[587,600] [2022-01-31 01:25:59,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:25:59,164 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 01:25:59,178 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/s1if.c[587,600] [2022-01-31 01:25:59,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:25:59,210 INFO L208 MainTranslator]: Completed translation [2022-01-31 01:25:59,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59 WrapperNode [2022-01-31 01:25:59,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 01:25:59,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 01:25:59,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 01:25:59,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 01:25:59,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (1/1) ... [2022-01-31 01:25:59,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (1/1) ... [2022-01-31 01:25:59,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (1/1) ... [2022-01-31 01:25:59,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (1/1) ... [2022-01-31 01:25:59,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (1/1) ... [2022-01-31 01:25:59,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (1/1) ... [2022-01-31 01:25:59,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (1/1) ... [2022-01-31 01:25:59,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 01:25:59,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 01:25:59,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 01:25:59,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 01:25:59,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (1/1) ... [2022-01-31 01:25:59,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:25:59,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:25:59,289 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 01:25:59,314 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 01:25:59,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 01:25:59,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 01:25:59,327 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 01:25:59,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 01:25:59,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 01:25:59,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 01:25:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 01:25:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 01:25:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 01:25:59,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 01:25:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 01:25:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 01:25:59,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 01:25:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 01:25:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 01:25:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 01:25:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 01:25:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 01:25:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 01:25:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 01:25:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 01:25:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 01:25:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 01:25:59,422 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 01:25:59,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 01:25:59,581 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 01:25:59,586 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 01:25:59,586 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 01:25:59,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:25:59 BoogieIcfgContainer [2022-01-31 01:25:59,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 01:25:59,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 01:25:59,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 01:25:59,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 01:25:59,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:25:58" (1/3) ... [2022-01-31 01:25:59,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbd3b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:25:59, skipping insertion in model container [2022-01-31 01:25:59,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:25:59" (2/3) ... [2022-01-31 01:25:59,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbd3b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:25:59, skipping insertion in model container [2022-01-31 01:25:59,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:25:59" (3/3) ... [2022-01-31 01:25:59,609 INFO L111 eAbstractionObserver]: Analyzing ICFG s1if.c [2022-01-31 01:25:59,613 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 01:25:59,613 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 01:25:59,697 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 01:25:59,719 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 01:25:59,720 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 01:25:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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 01:25:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 01:25:59,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:25:59,745 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 01:25:59,745 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:25:59,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:25:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash 863653859, now seen corresponding path program 1 times [2022-01-31 01:25:59,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:25:59,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845341379] [2022-01-31 01:25:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:25:59,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:25:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:25:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:25:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,021 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 01:26:00,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:00,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845341379] [2022-01-31 01:26:00,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845341379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:26:00,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:26:00,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 01:26:00,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190422716] [2022-01-31 01:26:00,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:26:00,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 01:26:00,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 01:26:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:26:00,062 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 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 01:26:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:00,139 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-01-31 01:26:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 01:26:00,141 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 01:26:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:00,147 INFO L225 Difference]: With dead ends: 54 [2022-01-31 01:26:00,147 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 01:26:00,149 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 01:26:00,152 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:00,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:26:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 01:26:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 01:26:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 01:26:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-01-31 01:26:00,180 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-01-31 01:26:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:00,181 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-01-31 01:26:00,181 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 01:26:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-01-31 01:26:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 01:26:00,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:00,182 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 01:26:00,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 01:26:00,183 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1121819297, now seen corresponding path program 1 times [2022-01-31 01:26:00,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:00,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121020552] [2022-01-31 01:26:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:00,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,266 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 01:26:00,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:00,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121020552] [2022-01-31 01:26:00,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121020552] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:26:00,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:26:00,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 01:26:00,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872994883] [2022-01-31 01:26:00,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:26:00,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 01:26:00,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 01:26:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 01:26:00,269 INFO L87 Difference]: Start difference. First operand 25 states and 27 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 01:26:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:00,329 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-01-31 01:26:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 01:26:00,329 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 01:26:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:00,330 INFO L225 Difference]: With dead ends: 40 [2022-01-31 01:26:00,330 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 01:26:00,331 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 01:26:00,332 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:00,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 24 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:26:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 01:26:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-01-31 01:26:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 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 01:26:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-01-31 01:26:00,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2022-01-31 01:26:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:00,339 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-01-31 01:26:00,339 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 01:26:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-01-31 01:26:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:26:00,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:00,340 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] [2022-01-31 01:26:00,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 01:26:00,340 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash -667943349, now seen corresponding path program 1 times [2022-01-31 01:26:00,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:00,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730844284] [2022-01-31 01:26:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:00,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:00,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:00,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730844284] [2022-01-31 01:26:00,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730844284] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:00,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501593217] [2022-01-31 01:26:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:00,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:00,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:00,708 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 01:26:00,710 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 01:26:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:00,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-31 01:26:00,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:00,905 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 01:26:00,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:00,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:01,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:26:01,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2022-01-31 01:26:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:01,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:01,654 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:01,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-31 01:26:01,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:26:01,660 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 24 treesize of output 16 [2022-01-31 01:26:01,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-01-31 01:26:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:01,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501593217] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:01,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:01,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 25 [2022-01-31 01:26:01,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002192069] [2022-01-31 01:26:01,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:01,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 01:26:01,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 01:26:01,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=497, Unknown=1, NotChecked=0, Total=600 [2022-01-31 01:26:01,723 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 25 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:26:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:02,055 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-01-31 01:26:02,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:26:02,056 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-01-31 01:26:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:02,059 INFO L225 Difference]: With dead ends: 46 [2022-01-31 01:26:02,059 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 01:26:02,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=815, Unknown=1, NotChecked=0, Total=992 [2022-01-31 01:26:02,064 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:02,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 84 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 217 Invalid, 0 Unknown, 115 Unchecked, 0.2s Time] [2022-01-31 01:26:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 01:26:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-01-31 01:26:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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 01:26:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-01-31 01:26:02,075 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 26 [2022-01-31 01:26:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:02,075 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-01-31 01:26:02,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:26:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-01-31 01:26:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:26:02,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:02,076 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] [2022-01-31 01:26:02,105 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 01:26:02,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:02,302 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:02,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1477289975, now seen corresponding path program 1 times [2022-01-31 01:26:02,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:02,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886596736] [2022-01-31 01:26:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:02,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:02,318 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:26:02,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146938570] [2022-01-31 01:26:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:02,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:02,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:02,319 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 01:26:02,321 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 01:26:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:02,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 01:26:02,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:02,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:02,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 01:26:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:02,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:02,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-01-31 01:26:02,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-31 01:26:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:02,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:02,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886596736] [2022-01-31 01:26:02,514 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:26:02,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146938570] [2022-01-31 01:26:02,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146938570] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:02,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:26:02,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 01:26:02,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535059171] [2022-01-31 01:26:02,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:02,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 01:26:02,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 01:26:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 01:26:02,516 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:02,565 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-31 01:26:02,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 01:26:02,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-01-31 01:26:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:02,567 INFO L225 Difference]: With dead ends: 50 [2022-01-31 01:26:02,567 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 01:26:02,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 01:26:02,568 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:02,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 108 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:26:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 01:26:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-31 01:26:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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 01:26:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-31 01:26:02,574 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2022-01-31 01:26:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:02,574 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-31 01:26:02,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-31 01:26:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 01:26:02,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:02,575 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] [2022-01-31 01:26:02,606 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 01:26:02,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 01:26:02,802 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1722810441, now seen corresponding path program 2 times [2022-01-31 01:26:02,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519020341] [2022-01-31 01:26:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:02,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:02,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519020341] [2022-01-31 01:26:02,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519020341] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729929677] [2022-01-31 01:26:02,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:26:02,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:02,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:02,900 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 01:26:02,920 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 01:26:02,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:26:02,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:02,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:26:02,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:03,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:03,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729929677] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:03,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:03,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:26:03,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412052671] [2022-01-31 01:26:03,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:03,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:26:03,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:03,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:26:03,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:26:03,133 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 01:26:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:03,311 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-01-31 01:26:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:26:03,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 28 [2022-01-31 01:26:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:03,313 INFO L225 Difference]: With dead ends: 45 [2022-01-31 01:26:03,313 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 01:26:03,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 01:26:03,316 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:03,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 01:26:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-01-31 01:26:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 01:26:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-31 01:26:03,326 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-01-31 01:26:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:03,326 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-31 01:26:03,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 01:26:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-31 01:26:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 01:26:03,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:03,327 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:03,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-31 01:26:03,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:03,544 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1559730403, now seen corresponding path program 3 times [2022-01-31 01:26:03,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:03,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018918373] [2022-01-31 01:26:03,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:03,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:03,615 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 01:26:03,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:03,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018918373] [2022-01-31 01:26:03,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018918373] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:03,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161976445] [2022-01-31 01:26:03,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:26:03,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:03,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:03,617 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 01:26:03,618 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 01:26:03,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 01:26:03,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:03,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:26:03,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:03,766 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 01:26:03,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:03,848 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 01:26:03,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161976445] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:03,849 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:03,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:26:03,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211779985] [2022-01-31 01:26:03,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:03,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:26:03,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:26:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:26:03,850 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 01:26:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:03,977 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-01-31 01:26:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:26:03,978 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 29 [2022-01-31 01:26:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:03,979 INFO L225 Difference]: With dead ends: 49 [2022-01-31 01:26:03,979 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 01:26:03,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 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 01:26:03,980 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:03,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 01:26:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-01-31 01:26:03,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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 01:26:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-31 01:26:03,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2022-01-31 01:26:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:03,986 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-31 01:26:03,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 01:26:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-31 01:26:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:26:03,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:03,987 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:04,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:04,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:04,203 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:04,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1063218725, now seen corresponding path program 4 times [2022-01-31 01:26:04,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:04,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328966575] [2022-01-31 01:26:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:04,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:04,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:04,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:04,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328966575] [2022-01-31 01:26:04,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328966575] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:04,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990839026] [2022-01-31 01:26:04,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:26:04,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:04,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:04,680 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 01:26:04,682 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 01:26:04,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:26:04,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:04,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 01:26:04,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:04,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:04,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:04,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:04,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:04,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:04,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:04,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:26:05,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:05,088 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:05,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:26:05,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:05,232 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:05,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2022-01-31 01:26:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:05,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:10,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_47 Int) (v_ArrVal_153 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_44 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_153 (+ main_~a~0.offset (* v_main_~i~0_47 4)))) (.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))))) (or (let ((.cse1 (+ c_main_~i~0 1)) (.cse0 (+ .cse2 .cse3 .cse4))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 1)) (not (= .cse2 1)))))))) is different from false [2022-01-31 01:26:10,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_47 Int) (v_ArrVal_153 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_44 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_153 (+ main_~a~0.offset (* v_main_~i~0_47 4)))) (.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_44 4))))) (or (let ((.cse1 (+ .cse2 .cse3 .cse4)) (.cse0 (+ c_main_~i~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 1)) (not (= .cse2 1)))))))) is different from false [2022-01-31 01:26:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-31 01:26:10,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990839026] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:10,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:10,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2022-01-31 01:26:10,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190352658] [2022-01-31 01:26:10,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:10,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 01:26:10,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:10,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 01:26:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1129, Unknown=4, NotChecked=138, Total=1406 [2022-01-31 01:26:10,454 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 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 01:26:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:10,826 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-31 01:26:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:26:10,827 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 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 31 [2022-01-31 01:26:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:10,828 INFO L225 Difference]: With dead ends: 49 [2022-01-31 01:26:10,828 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 01:26:10,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=203, Invalid=1523, Unknown=4, NotChecked=162, Total=1892 [2022-01-31 01:26:10,829 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:10,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 166 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 262 Invalid, 0 Unknown, 239 Unchecked, 0.2s Time] [2022-01-31 01:26:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 01:26:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-01-31 01:26:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 01:26:10,836 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2022-01-31 01:26:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:10,836 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 01:26:10,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 35 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 01:26:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 01:26:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:26:10,837 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:10,837 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] [2022-01-31 01:26:10,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-31 01:26:11,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:11,056 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash 253872099, now seen corresponding path program 1 times [2022-01-31 01:26:11,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39563125] [2022-01-31 01:26:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:11,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:11,068 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:26:11,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399491617] [2022-01-31 01:26:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:11,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:11,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:11,070 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 01:26:11,075 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 01:26:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:11,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 01:26:11,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:11,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:26:11,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:11,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:26:11,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 01:26:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:11,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:11,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_190) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 01:26:11,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_190) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 01:26:11,430 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:11,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:26:11,437 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:11,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:26:11,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-31 01:26:11,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:11,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39563125] [2022-01-31 01:26:11,511 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:26:11,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399491617] [2022-01-31 01:26:11,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399491617] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:11,512 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:26:11,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-01-31 01:26:11,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988362190] [2022-01-31 01:26:11,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:11,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:26:11,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:11,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:26:11,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-01-31 01:26:11,514 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:11,685 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-01-31 01:26:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 01:26:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 01:26:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:11,686 INFO L225 Difference]: With dead ends: 53 [2022-01-31 01:26:11,686 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 01:26:11,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2022-01-31 01:26:11,687 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:11,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 126 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-01-31 01:26:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 01:26:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 01:26:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 01:26:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-01-31 01:26:11,694 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 31 [2022-01-31 01:26:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:11,694 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-01-31 01:26:11,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-01-31 01:26:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 01:26:11,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:11,695 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] [2022-01-31 01:26:11,721 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 01:26:11,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:11,908 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:11,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash 656866023, now seen corresponding path program 5 times [2022-01-31 01:26:11,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:11,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775613184] [2022-01-31 01:26:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:11,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:11,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775613184] [2022-01-31 01:26:11,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775613184] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432273560] [2022-01-31 01:26:11,995 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:26:11,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:11,997 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 01:26:11,998 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 01:26:12,059 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 01:26:12,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:12,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:26:12,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:12,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:12,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432273560] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:12,259 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:12,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:26:12,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782780240] [2022-01-31 01:26:12,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:12,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:26:12,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:12,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:26:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:26:12,261 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 01:26:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:12,509 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-01-31 01:26:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:26:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-01-31 01:26:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:12,510 INFO L225 Difference]: With dead ends: 53 [2022-01-31 01:26:12,511 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 01:26:12,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 01:26:12,511 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:12,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 83 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:26:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 01:26:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-01-31 01:26:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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 01:26:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-01-31 01:26:12,517 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-01-31 01:26:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:12,517 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-01-31 01:26:12,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 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 01:26:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-01-31 01:26:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:26:12,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:12,518 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:26:12,548 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 01:26:12,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:12,740 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 641786569, now seen corresponding path program 6 times [2022-01-31 01:26:12,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:12,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607177995] [2022-01-31 01:26:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:12,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:12,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:12,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:12,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607177995] [2022-01-31 01:26:12,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607177995] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691869806] [2022-01-31 01:26:12,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:26:12,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:12,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:12,832 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 01:26:12,838 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 01:26:12,890 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 01:26:12,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:12,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:26:12,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:13,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:13,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691869806] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:13,078 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:13,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:26:13,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091018051] [2022-01-31 01:26:13,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:13,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:26:13,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:13,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:26:13,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:26:13,079 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 01:26:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:13,211 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-01-31 01:26:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:26:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 34 [2022-01-31 01:26:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:13,213 INFO L225 Difference]: With dead ends: 57 [2022-01-31 01:26:13,213 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 01:26:13,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 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 01:26:13,214 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:13,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 41 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 01:26:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-01-31 01:26:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 30 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 01:26:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-01-31 01:26:13,219 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2022-01-31 01:26:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:13,219 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-01-31 01:26:13,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 01:26:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-01-31 01:26:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:26:13,220 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:13,220 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:13,244 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 01:26:13,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 01:26:13,421 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1793718585, now seen corresponding path program 7 times [2022-01-31 01:26:13,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:13,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332017376] [2022-01-31 01:26:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:13,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:13,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:13,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332017376] [2022-01-31 01:26:13,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332017376] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:13,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25510651] [2022-01-31 01:26:13,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:26:13,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:13,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:13,997 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 01:26:13,998 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 01:26:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:14,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 01:26:14,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:14,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:14,092 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 01:26:14,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:14,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:14,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:14,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:26:14,403 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:14,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:26:14,514 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:14,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:26:14,677 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:14,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 17 [2022-01-31 01:26:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:14,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:21,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse7 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse4 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ c_main_~i~0 1)) (.cse2 (+ .cse4 .cse1 .cse5 .cse0))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= .cse4 1))))))))) is different from false [2022-01-31 01:26:21,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse7 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (let ((.cse4 (+ c_main_~i~0 2)) (.cse3 (+ .cse2 .cse1 .cse5 .cse0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2022-01-31 01:26:21,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (v_main_~i~0_92 Int) (main_~a~0.offset Int) (v_main_~i~0_89 Int) (v_main_~i~0_87 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_303))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse7 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_303 (+ main_~a~0.offset (* v_main_~i~0_92 4))))) (let ((.cse1 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_89 4))))) (let ((.cse2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse1 .cse5 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_87 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (let ((.cse4 (+ .cse2 .cse1 .cse5 .cse0)) (.cse3 (+ c_main_~i~0 3))) (and (<= .cse3 .cse4) (<= .cse4 .cse3)))))))))) is different from false [2022-01-31 01:26:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-31 01:26:22,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25510651] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:22,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:22,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 45 [2022-01-31 01:26:22,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54248706] [2022-01-31 01:26:22,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:22,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 01:26:22,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 01:26:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1564, Unknown=7, NotChecked=246, Total=1980 [2022-01-31 01:26:22,302 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 45 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 states have internal predecessors, (70), 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 01:26:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:22,713 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-01-31 01:26:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:26:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 states have internal predecessors, (70), 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 36 [2022-01-31 01:26:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:22,714 INFO L225 Difference]: With dead ends: 56 [2022-01-31 01:26:22,714 INFO L226 Difference]: Without dead ends: 50 [2022-01-31 01:26:22,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=226, Invalid=2035, Unknown=7, NotChecked=282, Total=2550 [2022-01-31 01:26:22,715 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:22,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 182 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 292 Invalid, 0 Unknown, 224 Unchecked, 0.2s Time] [2022-01-31 01:26:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-31 01:26:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-01-31 01:26:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 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 01:26:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-31 01:26:22,723 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-01-31 01:26:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:22,723 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-31 01:26:22,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 states have internal predecessors, (70), 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 01:26:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-31 01:26:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:26:22,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:22,724 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:22,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:22,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:22,928 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1691902085, now seen corresponding path program 2 times [2022-01-31 01:26:22,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:22,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30865683] [2022-01-31 01:26:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:22,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:22,938 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:26:22,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751095670] [2022-01-31 01:26:22,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:26:22,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:22,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:22,940 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:22,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 01:26:23,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:26:23,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:23,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 01:26:23,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:23,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:26:23,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:23,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:26:23,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:23,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:26:23,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:26:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:23,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:23,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 01:26:23,268 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 1)) is different from false [2022-01-31 01:26:23,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_351) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)) is different from false [2022-01-31 01:26:23,291 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:23,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-31 01:26:23,297 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:23,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 38 treesize of output 38 [2022-01-31 01:26:23,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-31 01:26:23,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30865683] [2022-01-31 01:26:23,380 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:26:23,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751095670] [2022-01-31 01:26:23,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751095670] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:23,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:26:23,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-01-31 01:26:23,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720257763] [2022-01-31 01:26:23,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:23,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 01:26:23,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 01:26:23,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-01-31 01:26:23,382 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:23,592 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-01-31 01:26:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:26:23,593 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-01-31 01:26:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:23,593 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:26:23,593 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 01:26:23,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=349, Unknown=3, NotChecked=120, Total=552 [2022-01-31 01:26:23,594 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:23,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 202 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 172 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2022-01-31 01:26:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 01:26:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-01-31 01:26:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 01:26:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-01-31 01:26:23,613 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 36 [2022-01-31 01:26:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:23,613 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-01-31 01:26:23,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-01-31 01:26:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 01:26:23,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:23,619 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:23,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:23,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 01:26:23,839 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:23,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1556995259, now seen corresponding path program 8 times [2022-01-31 01:26:23,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:23,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31454650] [2022-01-31 01:26:23,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:23,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:23,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:23,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31454650] [2022-01-31 01:26:23,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31454650] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:23,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744310533] [2022-01-31 01:26:23,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:26:23,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:23,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:23,952 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:23,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 01:26:24,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:26:24,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:24,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:26:24,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:24,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:24,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744310533] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:24,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:24,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:26:24,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584680285] [2022-01-31 01:26:24,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:24,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:26:24,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:24,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:26:24,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:26:24,221 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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 01:26:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:24,495 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-01-31 01:26:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:26:24,496 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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 38 [2022-01-31 01:26:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:24,496 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:26:24,496 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 01:26:24,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 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 01:26:24,498 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 57 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:24,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 61 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:26:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 01:26:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-01-31 01:26:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 01:26:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-01-31 01:26:24,504 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2022-01-31 01:26:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:24,504 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-01-31 01:26:24,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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 01:26:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-01-31 01:26:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:26:24,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:24,505 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:24,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:24,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 01:26:24,706 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1305678105, now seen corresponding path program 9 times [2022-01-31 01:26:24,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:24,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858083725] [2022-01-31 01:26:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:24,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:24,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:24,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:24,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:24,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858083725] [2022-01-31 01:26:24,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858083725] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:24,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442255080] [2022-01-31 01:26:24,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:26:24,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:24,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:24,801 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:24,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 01:26:24,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:26:24,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:24,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:26:24,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:25,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:25,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442255080] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:25,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:25,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:26:25,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694710061] [2022-01-31 01:26:25,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:25,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:26:25,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:26:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:26:25,093 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 01:26:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:25,251 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-01-31 01:26:25,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:26:25,252 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 39 [2022-01-31 01:26:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:25,252 INFO L225 Difference]: With dead ends: 65 [2022-01-31 01:26:25,252 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 01:26:25,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 01:26:25,253 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:25,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 72 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 01:26:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-31 01:26:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-01-31 01:26:25,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2022-01-31 01:26:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:25,260 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-01-31 01:26:25,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 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 01:26:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-01-31 01:26:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:26:25,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:25,261 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:25,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:25,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 01:26:25,475 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1417373271, now seen corresponding path program 10 times [2022-01-31 01:26:25,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110815604] [2022-01-31 01:26:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:25,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:26,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:26,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:26,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110815604] [2022-01-31 01:26:26,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110815604] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:26,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876300297] [2022-01-31 01:26:26,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:26:26,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:26,184 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:26,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 01:26:26,255 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:26:26,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:26,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-31 01:26:26,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:26,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:26,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:26,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:26,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:26,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:26,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:26,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:26,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:26,527 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:26,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:26,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:26:26,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:26,869 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:26,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:26:27,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:27,037 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:27,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:26:27,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:27,201 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:27,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:26:27,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:27,352 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:27,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2022-01-31 01:26:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:27,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:48,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (let ((.cse1 (+ c_main_~i~0 1)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse6 1)) (not (= .cse3 1)) (not (= .cse4 1)) (not (= .cse2 1)))))))))) is different from false [2022-01-31 01:26:49,878 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse1 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (not (= .cse3 1)) (let ((.cse5 (+ c_main_~i~0 2)) (.cse4 (+ .cse3 .cse1 .cse2 .cse6 .cse0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))))))))))) is different from false [2022-01-31 01:26:52,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse2 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse5 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse4 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse6 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (let ((.cse1 (+ c_main_~i~0 3)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse6 1)) (not (= .cse3 1)) (not (= .cse4 1)) (not (= .cse2 1)))))))))) is different from false [2022-01-31 01:26:54,970 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_145 Int) (v_main_~i~0_152 Int) (main_~a~0.offset Int) (v_ArrVal_487 (Array Int Int)) (v_main_~i~0_149 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse3 (select v_ArrVal_487 (+ main_~a~0.offset (* 4 v_main_~i~0_152)))) (.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_149))))) (let ((.cse2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse1 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_147))))) (let ((.cse0 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse1 .cse2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_145))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (not (= .cse3 1)) (let ((.cse5 (+ c_main_~i~0 4)) (.cse4 (+ .cse3 .cse1 .cse2 .cse6 .cse0))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))))))))))) is different from false [2022-01-31 01:26:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-01-31 01:26:56,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876300297] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:56,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:56,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 20] total 57 [2022-01-31 01:26:56,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625130306] [2022-01-31 01:26:56,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:56,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-01-31 01:26:56,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:56,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-01-31 01:26:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2545, Unknown=13, NotChecked=420, Total=3192 [2022-01-31 01:26:56,352 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 57 states, 55 states have (on average 1.6) internal successors, (88), 54 states have internal predecessors, (88), 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 01:26:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:57,089 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-01-31 01:26:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 01:26:57,089 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 1.6) internal successors, (88), 54 states have internal predecessors, (88), 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 41 [2022-01-31 01:26:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:57,090 INFO L225 Difference]: With dead ends: 66 [2022-01-31 01:26:57,090 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 01:26:57,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=285, Invalid=3140, Unknown=13, NotChecked=468, Total=3906 [2022-01-31 01:26:57,092 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 353 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:57,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 214 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 436 Invalid, 0 Unknown, 353 Unchecked, 0.2s Time] [2022-01-31 01:26:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 01:26:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-01-31 01:26:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-01-31 01:26:57,101 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 41 [2022-01-31 01:26:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:57,101 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-01-31 01:26:57,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 1.6) internal successors, (88), 54 states have internal predecessors, (88), 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 01:26:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-01-31 01:26:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:26:57,102 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:57,103 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:57,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:57,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 01:26:57,307 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2068247399, now seen corresponding path program 3 times [2022-01-31 01:26:57,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:57,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556877802] [2022-01-31 01:26:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:57,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:57,319 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:26:57,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393166136] [2022-01-31 01:26:57,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:26:57,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:57,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:57,323 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:57,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 01:26:57,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:26:57,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:57,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-31 01:26:57,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:57,445 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 01:26:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:57,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:26:57,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:57,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:26:57,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:57,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-31 01:26:57,666 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:57,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-01-31 01:26:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 01:26:57,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:57,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~N~0) (not (< main_~i~0 c_~N~0)) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_546) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4))) 1))) is different from false [2022-01-31 01:26:57,979 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:57,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-31 01:26:57,987 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-01-31 01:26:57,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-01-31 01:26:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2022-01-31 01:26:58,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:58,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556877802] [2022-01-31 01:26:58,030 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:26:58,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393166136] [2022-01-31 01:26:58,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393166136] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:58,030 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:26:58,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-01-31 01:26:58,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812723605] [2022-01-31 01:26:58,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:58,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 01:26:58,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:58,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 01:26:58,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=151, Unknown=6, NotChecked=26, Total=240 [2022-01-31 01:26:58,032 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:00,112 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-01-31 01:27:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 01:27:00,113 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-01-31 01:27:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:00,114 INFO L225 Difference]: With dead ends: 68 [2022-01-31 01:27:00,114 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 01:27:00,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=70, Invalid=168, Unknown=6, NotChecked=28, Total=272 [2022-01-31 01:27:00,115 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:00,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 38 Unchecked, 0.0s Time] [2022-01-31 01:27:00,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 01:27:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-01-31 01:27:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-01-31 01:27:00,129 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 41 [2022-01-31 01:27:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:00,130 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-01-31 01:27:00,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-01-31 01:27:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 01:27:00,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:00,130 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:00,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 01:27:00,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:00,335 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1382245397, now seen corresponding path program 11 times [2022-01-31 01:27:00,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:00,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461779676] [2022-01-31 01:27:00,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:00,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:27:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:00,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:27:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:27:00,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461779676] [2022-01-31 01:27:00,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461779676] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:27:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424531888] [2022-01-31 01:27:00,491 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:27:00,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:00,496 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:00,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 01:27:00,623 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 01:27:00,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:00,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:27:00,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:27:00,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:27:00,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424531888] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:00,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:27:00,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:27:00,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130063794] [2022-01-31 01:27:00,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:00,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:27:00,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:00,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:27:00,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:27:00,860 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 01:27:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:01,170 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-01-31 01:27:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:27:01,170 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 43 [2022-01-31 01:27:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:01,171 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:27:01,171 INFO L226 Difference]: Without dead ends: 75 [2022-01-31 01:27:01,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 81 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 01:27:01,172 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 57 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:01,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 81 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:27:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-31 01:27:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 50. [2022-01-31 01:27:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 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 01:27:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-01-31 01:27:01,180 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-01-31 01:27:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:01,180 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-01-31 01:27:01,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 01:27:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-01-31 01:27:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 01:27:01,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:01,181 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:01,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 01:27:01,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 01:27:01,395 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 532928709, now seen corresponding path program 12 times [2022-01-31 01:27:01,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:01,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161347721] [2022-01-31 01:27:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:01,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:27:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:27:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:27:01,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:01,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161347721] [2022-01-31 01:27:01,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161347721] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:27:01,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846239343] [2022-01-31 01:27:01,550 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:27:01,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:01,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:01,551 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:01,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 01:27:01,661 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 01:27:01,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:01,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:27:01,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:27:01,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:27:01,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846239343] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:01,924 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:27:01,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:27:01,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79748199] [2022-01-31 01:27:01,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:01,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:27:01,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:01,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:27:01,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:27:01,925 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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 01:27:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:02,106 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-01-31 01:27:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:27:02,107 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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 44 [2022-01-31 01:27:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:02,107 INFO L225 Difference]: With dead ends: 90 [2022-01-31 01:27:02,108 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 01:27:02,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:27:02,108 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 78 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:02,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 49 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:27:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 01:27:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-01-31 01:27:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-01-31 01:27:02,117 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 44 [2022-01-31 01:27:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:02,117 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-01-31 01:27:02,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 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 01:27:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-01-31 01:27:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:27:02,118 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:02,118 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:02,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 01:27:02,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 01:27:02,332 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -944597181, now seen corresponding path program 13 times [2022-01-31 01:27:02,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:02,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322955634] [2022-01-31 01:27:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:02,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:03,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:27:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:03,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:27:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:27:03,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:03,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322955634] [2022-01-31 01:27:03,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322955634] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:27:03,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179842390] [2022-01-31 01:27:03,172 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:27:03,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:03,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:03,182 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 01:27:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:03,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-31 01:27:03,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:03,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:27:03,282 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 01:27:03,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:03,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:03,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:03,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:03,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:03,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:27:03,729 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:03,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2022-01-31 01:27:03,856 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:03,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:27:04,002 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:04,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:27:04,155 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:04,156 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:27:04,281 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:04,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2022-01-31 01:27:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:27:04,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:44,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_220 Int) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse9 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse7 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse7 .cse2 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse7 .cse2 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_220))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse7 .cse2 .cse0 .cse3 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (not (= .cse3 1)) (not (= .cse4 1)) (let ((.cse6 (+ c_main_~i~0 1)) (.cse5 (+ .cse7 .cse2 .cse0 .cse3 .cse4 .cse1))) (and (<= .cse5 .cse6) (<= .cse6 .cse5)))))))))))) is different from false [2022-01-31 01:27:51,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_220 Int) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse9 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse5 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse4 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse0 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_220))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse0 .cse6 .cse7))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ .cse4 .cse5 .cse0 .cse6 .cse7 .cse1)) (.cse2 (+ c_main_~i~0 2))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= .cse5 1)) (not (= .cse6 1)) (not (= .cse7 1))))))))))) is different from false [2022-01-31 01:28:08,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_220 Int) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse9 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse2 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse2 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_220))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse2 .cse0 .cse3 .cse7))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (not (= .cse3 1)) (let ((.cse5 (+ .cse6 .cse2 .cse0 .cse3 .cse7 .cse1)) (.cse4 (+ c_main_~i~0 3))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))) (not (= .cse7 1))))))))))) is different from false [2022-01-31 01:28:31,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_220 Int) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse9 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse5 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_220))))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0 .cse5 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (or (not (= .cse0 1)) (let ((.cse2 (+ .cse3 .cse4 .cse0 .cse5 .cse6 .cse7)) (.cse1 (+ c_main_~i~0 4))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse7 1)) (not (= .cse4 1)) (not (= .cse5 1)) (not (= .cse6 1))))))))))) is different from false [2022-01-31 01:29:01,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_224 Int) (v_main_~i~0_222 Int) (v_main_~i~0_220 Int) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_ArrVal_709 (Array Int Int)) (v_main_~i~0_227 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_709))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse9 |c_main_~#sum~0.offset|)) (.cse0 (select v_ArrVal_709 (+ main_~a~0.offset (* 4 v_main_~i~0_227))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_224))))) (let ((.cse3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse2 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_222) main_~a~0.offset)))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse2 .cse0 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_220))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse2 .cse0 .cse3 .cse7))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (not (= .cse3 1)) (let ((.cse5 (+ .cse6 .cse2 .cse0 .cse3 .cse7 .cse1)) (.cse4 (+ c_main_~i~0 5))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))) (not (= .cse7 1))))))))))) is different from false [2022-01-31 01:29:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-01-31 01:29:17,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179842390] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:29:17,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:29:17,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23, 23] total 66 [2022-01-31 01:29:17,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730545351] [2022-01-31 01:29:17,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:29:17,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-31 01:29:17,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:29:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-31 01:29:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3421, Unknown=19, NotChecked=610, Total=4290 [2022-01-31 01:29:17,973 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 66 states, 64 states have (on average 1.578125) internal successors, (101), 63 states have internal predecessors, (101), 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 01:29:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:29:19,662 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-01-31 01:29:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 01:29:19,670 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.578125) internal successors, (101), 63 states have internal predecessors, (101), 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 46 [2022-01-31 01:29:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:29:19,670 INFO L225 Difference]: With dead ends: 79 [2022-01-31 01:29:19,670 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 01:29:19,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=312, Invalid=4111, Unknown=19, NotChecked=670, Total=5112 [2022-01-31 01:29:19,672 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 755 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:29:19,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 255 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 604 Invalid, 0 Unknown, 755 Unchecked, 0.4s Time] [2022-01-31 01:29:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 01:29:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2022-01-31 01:29:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 59 states have internal predecessors, (67), 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 01:29:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-01-31 01:29:19,684 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 46 [2022-01-31 01:29:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:29:19,684 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-01-31 01:29:19,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.578125) internal successors, (101), 63 states have internal predecessors, (101), 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 01:29:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-01-31 01:29:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:29:19,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:29:19,685 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:29:19,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-31 01:29:19,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:19,900 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:29:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:29:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash -243532603, now seen corresponding path program 4 times [2022-01-31 01:29:19,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:29:19,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314291609] [2022-01-31 01:29:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:29:19,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:29:19,909 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:29:19,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188142216] [2022-01-31 01:29:19,909 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:29:19,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:29:19,911 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:29:19,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-31 01:29:19,992 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:29:19,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:29:19,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-31 01:29:19,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:29:20,069 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 01:29:20,128 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:29:20,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:29:20,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:20,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:29:20,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:20,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:29:20,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:20,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-31 01:29:20,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:29:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 01:29:20,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:29:20,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 01:29:20,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 1)) is different from false [2022-01-31 01:29:20,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)) 1)) is different from false [2022-01-31 01:29:20,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 1)) is different from false [2022-01-31 01:29:20,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_776)) |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 1)) is different from false [2022-01-31 01:29:20,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_247 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_247)) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_247)) v_ArrVal_776)) |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 1)))) is different from false [2022-01-31 01:29:20,477 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 01:29:20,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-01-31 01:29:20,483 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:29:20,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-31 01:29:20,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:29:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 31 not checked. [2022-01-31 01:29:20,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:29:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314291609] [2022-01-31 01:29:20,602 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:29:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188142216] [2022-01-31 01:29:20,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188142216] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:29:20,602 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:29:20,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 01:29:20,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599864197] [2022-01-31 01:29:20,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:29:20,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:29:20,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:29:20,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:29:20,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=364, Unknown=6, NotChecked=258, Total=702 [2022-01-31 01:29:20,603 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:29:22,714 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_247 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_247)) (forall ((v_ArrVal_780 (Array Int Int)) (v_ArrVal_776 Int)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_247)) v_ArrVal_776)) |c_main_~#sum~0.base| v_ArrVal_780) c_main_~a~0.base) (+ c_main_~a~0.offset 12)) 1)))) (= (+ c_main_~i~0 (- 2)) 1) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1)) is different from false [2022-01-31 01:29:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:29:23,018 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-01-31 01:29:23,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:29:23,019 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-31 01:29:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:29:23,020 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:29:23,020 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 01:29:23,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=112, Invalid=611, Unknown=7, NotChecked=392, Total=1122 [2022-01-31 01:29:23,021 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:29:23,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 332 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 388 Invalid, 0 Unknown, 183 Unchecked, 0.2s Time] [2022-01-31 01:29:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 01:29:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-01-31 01:29:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 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 01:29:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-01-31 01:29:23,033 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 46 [2022-01-31 01:29:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:29:23,033 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-01-31 01:29:23,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:29:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-01-31 01:29:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 01:29:23,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:29:23,034 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:29:23,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-31 01:29:23,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:23,255 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:29:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:29:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash 787197505, now seen corresponding path program 14 times [2022-01-31 01:29:23,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:29:23,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83597655] [2022-01-31 01:29:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:29:23,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:29:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:29:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:23,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:29:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:29:23,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:29:23,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83597655] [2022-01-31 01:29:23,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83597655] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:29:23,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733824920] [2022-01-31 01:29:23,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:29:23,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:23,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:29:23,420 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:29:23,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-31 01:29:23,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:29:23,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:29:23,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 01:29:23,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:29:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:29:23,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:29:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:29:23,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733824920] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:29:23,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:29:23,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 01:29:23,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494644362] [2022-01-31 01:29:23,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:29:23,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:29:23,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:29:23,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:29:23,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:29:23,826 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 01:29:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:29:24,287 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-01-31 01:29:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 01:29:24,287 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 01:29:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:29:24,287 INFO L225 Difference]: With dead ends: 89 [2022-01-31 01:29:24,288 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 01:29:24,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2022-01-31 01:29:24,288 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:29:24,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 65 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:29:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 01:29:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2022-01-31 01:29:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:29:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-01-31 01:29:24,295 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 48 [2022-01-31 01:29:24,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:29:24,295 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-01-31 01:29:24,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 01:29:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-01-31 01:29:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 01:29:24,296 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:29:24,296 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:29:24,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 01:29:24,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:24,497 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:29:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:29:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1807662315, now seen corresponding path program 15 times [2022-01-31 01:29:24,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:29:24,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956451806] [2022-01-31 01:29:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:29:24,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:29:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:24,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:29:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:24,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:29:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:29:24,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:29:24,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956451806] [2022-01-31 01:29:24,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956451806] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:29:24,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889783343] [2022-01-31 01:29:24,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:29:24,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:24,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:29:24,670 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:29:24,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-31 01:29:24,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-01-31 01:29:24,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:29:24,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 01:29:24,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:29:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:29:24,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:29:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:29:25,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889783343] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:29:25,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:29:25,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-01-31 01:29:25,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098560318] [2022-01-31 01:29:25,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:29:25,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:29:25,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:29:25,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:29:25,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:29:25,083 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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 01:29:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:29:25,342 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-01-31 01:29:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 01:29:25,344 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-01-31 01:29:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:29:25,345 INFO L225 Difference]: With dead ends: 98 [2022-01-31 01:29:25,345 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 01:29:25,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2022-01-31 01:29:25,346 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 81 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:29:25,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 59 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:29:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 01:29:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-01-31 01:29:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:29:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-01-31 01:29:25,355 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 49 [2022-01-31 01:29:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:29:25,356 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-01-31 01:29:25,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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 01:29:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-01-31 01:29:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:29:25,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:29:25,356 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:29:25,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-31 01:29:25,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-31 01:29:25,567 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:29:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:29:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1738973907, now seen corresponding path program 16 times [2022-01-31 01:29:25,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:29:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668340868] [2022-01-31 01:29:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:29:25,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:29:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:29:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:29:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:29:26,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:29:26,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668340868] [2022-01-31 01:29:26,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668340868] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:29:26,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921190171] [2022-01-31 01:29:26,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:29:26,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:26,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:29:26,700 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:29:26,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-31 01:29:26,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:29:26,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:29:26,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-31 01:29:26,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:29:26,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:29:26,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:26,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:26,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:26,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:26,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:26,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:27,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:27,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:27,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:27,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:27,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:27,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:27,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:27,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:29:27,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:27,613 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:27,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-01-31 01:29:27,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:27,834 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:27,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:29:28,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:28,054 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:28,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:29:28,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:28,375 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:28,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:29:28,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:28,695 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:28,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:29:28,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:29:28,934 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:28,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 15 [2022-01-31 01:29:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:29:29,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:31,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_311 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (main_~a~0.offset Int) (v_main_~i~0_309 Int) (v_main_~i~0_317 Int) (v_main_~i~0_315 Int) (v_main_~i~0_313 Int)) (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse10 |c_main_~#sum~0.offset|)) (.cse1 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse8 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_317))))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_315))))) (let ((.cse0 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse7 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_313))))) (let ((.cse5 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse7 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse6 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse4 .cse1 .cse0 .cse5 .cse7 .cse8))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ c_main_~i~0 1)) (.cse2 (+ .cse4 .cse1 .cse0 .cse5 .cse6 .cse7 .cse8))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= .cse7 1)) (not (= .cse5 1)) (not (= 1 .cse8)) (not (= .cse6 1)))))))))))) is different from false [2022-01-31 01:32:19,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_311 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (main_~a~0.offset Int) (v_main_~i~0_309 Int) (v_main_~i~0_317 Int) (v_main_~i~0_315 Int) (v_main_~i~0_313 Int)) (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse10 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse8 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_317))))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_315))))) (let ((.cse0 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse7 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_313))))) (let ((.cse5 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0 .cse7 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse6 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0 .cse5 .cse7 .cse8))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (or (not (= .cse0 1)) (let ((.cse2 (+ .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8)) (.cse1 (+ c_main_~i~0 2))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse4 1)) (not (= .cse7 1)) (not (= .cse5 1)) (not (= 1 .cse8)) (not (= .cse6 1)))))))))))) is different from false [2022-01-31 01:34:32,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_311 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (main_~a~0.offset Int) (v_main_~i~0_309 Int) (v_main_~i~0_317 Int) (v_main_~i~0_315 Int) (v_main_~i~0_313 Int)) (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse10 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse8 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_317))))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_315))))) (let ((.cse4 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse7 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_313))))) (let ((.cse5 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse7 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse6 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4 .cse5 .cse7 .cse8))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (or (let ((.cse1 (+ c_main_~i~0 3)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse4 1)) (not (= .cse3 1)) (not (= .cse7 1)) (not (= .cse5 1)) (not (= 1 .cse8)) (not (= .cse6 1)))))))))))) is different from false [2022-01-31 01:38:06,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_311 Int) (v_ArrVal_966 (Array Int Int)) (v_main_~i~0_320 Int) (main_~a~0.offset Int) (v_main_~i~0_309 Int) (v_main_~i~0_317 Int) (v_main_~i~0_315 Int) (v_main_~i~0_313 Int)) (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_966))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse10 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_966 (+ main_~a~0.offset (* 4 v_main_~i~0_320))))) (let ((.cse8 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_317))))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_315))))) (let ((.cse0 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse7 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_313))))) (let ((.cse5 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0 .cse7 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_311))))) (let ((.cse6 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse0 .cse5 .cse7 .cse8))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_309) main_~a~0.offset)))) (or (not (= .cse0 1)) (let ((.cse2 (+ .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse8)) (.cse1 (+ c_main_~i~0 4))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse4 1)) (not (= .cse7 1)) (not (= .cse5 1)) (not (= 1 .cse8)) (not (= .cse6 1)))))))))))) is different from false